Submission #3008634
Source Code Expand
#include <iostream> #include <cstdio> #include <cstdlib> #include <cstring> #include <algorithm> #include <string> #include <sstream> #include <complex> #include <vector> #include <list> #include <queue> #include <deque> #include <stack> #include <map> #include <set> using namespace std; typedef long long unsigned int ll; #define EPS (1e-7) #define INF (1e9) #define PI (acos(-1)) bool comp(pair<int, int> in1, pair<int, int> in2) { if(in1.second < in2.second){ return true; } else { return false; } } int main() { //cout.precision(10); int n, m; cin >> n >> m; int a[100100]; for(int i = 1; i <= n; i++){ cin >> a[i]; } vector<pair<int, int> > c, b; for(int i = 1; i <= n - 1; i++){ pair<int, int> in; in.first = a[i]; if(a[i] > a[i + 1]){ in.second = a[i + 1] + m; } else { in.second = a[i + 1]; } b.push_back(in); c.push_back(in); } sort(b.begin(), b.end()); sort(c.begin(), c.end(), comp); /*for(int i = 0; i < n - 1; i++){ cout << b[i].first << " " << b[i].second << endl; } for(int i = 0; i < n - 1; i++){ cout << c[i].first << " " << c[i].second << endl; }*/ int minus[100100]; for(int i = 0; i <= m; i++){ minus[i] = 0; } int contain = 0; for(int i = 0; i < n - 1; i++){ if((b[i].first <= (m + 1 - 2)) && (b[i].second >= (m + 1))){ contain++; minus[1] += m - b[i].first; } } //cout << minus[1] << endl; for(int i = 2; i <= m; i++){ int ok = n - 2; int ng = -1; while(ok - ng > 1){ int mid = (ok + ng) / 2; if(b[mid].first >= (i - 2)){ ok = mid; } else { ng = mid; } } while(b[ok].first == (i - 2)){ contain++; ok++; if(ok > n - 2){ break; } } ok = n - 2; ng = -1; while(ok - ng > 1){ int mid = (ok + ng) / 2; if(c[mid].second >= (i - 1)){ ok = mid; } else { ng = mid; } } while(c[ok].second == (i - 1)){ contain--; minus[i] -= (c[ok].second - c[ok].first - 1); ok++; if(ok > n - 2){ break; } } ok = n - 2; ng = -1; while(ok - ng > 1){ int mid = (ok + ng) / 2; if(c[mid].second >= (i - 1 + m)){ ok = mid; } else { ng = mid; } } while(c[ok].second == (i - 1 + m)){ contain--; minus[i] -= (c[ok].second - c[ok].first - 1); ok++; if(ok > n - 2){ break; } } minus[i] += minus[i - 1] + contain; //cout << i << " " << contain << " " << minus[i] << endl; } int sum = 0; for(int i = 0; i < n - 1; i++){ sum += b[i].second - b[i].first; } int minimum = minus[1]; for(int i = 2; i <= m; i++){ minimum = max(minimum, minus[i]); } cout << sum - minimum << endl; /*for(int i = 1; i <= m; i++){ cout << minus[i] << endl; }*/ return 0; }
Submission Info
Submission Time | |
---|---|
Task | E - guruguru |
User | kort0n |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 3533 Byte |
Status | WA |
Exec Time | 73 ms |
Memory | 2796 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 700 | ||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample1.txt, sample2.txt |
All | half0.txt, half1.txt, half2.txt, half3.txt, half4.txt, min_m.txt, min_n.txt, mx0.txt, mx1.txt, mx2.txt, rnd0.txt, rnd1.txt, rnd2.txt, rnd3.txt, rnd4.txt, rnd5.txt, rnd6.txt, rnd7.txt, rnd8.txt, rnd9.txt, sample1.txt, sample2.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
half0.txt | AC | 21 ms | 1148 KB |
half1.txt | AC | 21 ms | 896 KB |
half2.txt | AC | 35 ms | 1652 KB |
half3.txt | AC | 41 ms | 2292 KB |
half4.txt | AC | 53 ms | 2292 KB |
min_m.txt | AC | 1 ms | 256 KB |
min_n.txt | AC | 2 ms | 640 KB |
mx0.txt | WA | 71 ms | 2796 KB |
mx1.txt | WA | 71 ms | 2796 KB |
mx2.txt | WA | 73 ms | 2796 KB |
rnd0.txt | AC | 2 ms | 384 KB |
rnd1.txt | AC | 1 ms | 256 KB |
rnd2.txt | AC | 5 ms | 384 KB |
rnd3.txt | WA | 10 ms | 892 KB |
rnd4.txt | WA | 32 ms | 2292 KB |
rnd5.txt | WA | 2 ms | 384 KB |
rnd6.txt | AC | 1 ms | 256 KB |
rnd7.txt | AC | 5 ms | 384 KB |
rnd8.txt | WA | 5 ms | 512 KB |
rnd9.txt | AC | 1 ms | 256 KB |
sample1.txt | AC | 1 ms | 256 KB |
sample2.txt | AC | 1 ms | 256 KB |