Submission #104331

#TimeUsernameProblemLanguageResultExecution timeMemory
104331ihdigniteCoin Collecting (JOI19_ho_t4)C++14
0 / 100
3 ms384 KiB
#include <bits/stdc++.h> using namespace std; #define ll long long const int mxN=1e5; int n, c[mxN][2]; ll a1; int main() { ios::sync_with_stdio(0); cin.tie(0); cin >> n; for(int i=0, x, y; i<2*n; ++i) { cin >> x >> y; if(x<1) { a1+=1-x; x=1; } if(x>n) { a1+=x-n; x=n; } if(y<1) { a1+=1-y; y=1; } if(y>2) { a1+=y-2; y=2; } ++c[x-1][y-1]; } for(int i1=0, i2=0, j=0; i1<n||i2<n; ) { while(!c[j][0]&&!c[j][1]) ++j; if(c[j][0]&&c[j][1]&&i1<n&&i2<n) { a1+=abs(i1-j)+abs(i2-j); --c[j][0], --c[j][1]; ++i1, ++i2; } else if(c[j][0]) { if(i1<=i2||i1<=j&&j<n-1&&c[j+1][1]) { a1+=abs(i1-j); ++i1; } else { a1+=abs(i2-j)+1; ++i2; } --c[j][0]; } else { if(i2<=i1||i2<=j&&j<n-1&&c[j+1][0]) { a1+=abs(i2-j); ++i2; } else { a1+=abs(i1-j)+1; ++i1; } --c[j][1]; } } cout << a1; }

Compilation message (stderr)

joi2019_ho_t4.cpp: In function 'int main()':
joi2019_ho_t4.cpp:43:27: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
    if(i1<=i2||i1<=j&&j<n-1&&c[j+1][1]) {
               ~~~~~~~~~~~~^~~~~~~~~~~
joi2019_ho_t4.cpp:52:27: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
    if(i2<=i1||i2<=j&&j<n-1&&c[j+1][0]) {
               ~~~~~~~~~~~~^~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...