# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
143411 | 2019-08-14T00:23:11 Z | daniel920712 | Arranging Shoes (IOI19_shoes) | C++14 | 2 ms | 380 KB |
#include <iostream> #include <stdio.h> #include <vector> #include <algorithm> #include <assert.h> using namespace std; int S1[1005]; int all[1005]; bool F(int a,int b) { return a<b; } long long count_swaps(std::vector<int> S) { long long ans1=0,ans2=0,ans3=0,ans4=0,N=S.size(),i,j,k,now=0; long long t; for(i=0;i<N;i++) S1[i]=S[i]; for(i=0;i<N;i++) if(S1[i]>0) all[now++]=S1[i]; for(i=0;i<N/2;i++) { for(j=2*i;j<N;j++) { if(S1[j]==0-all[i]) { for(k=j;k>2*i;k--) { ans1++; swap(S1[k],S1[k-1]); } break; } } for(j=2*i+1;j<N;j++) { if(S1[j]==all[i]) { for(k=j;k>2*i+1;k--) { ans1++; swap(S1[k],S1[k-1]); } } break; } } now=0; for(i=0;i<N;i++) S1[i]=S[i]; for(i=0;i<N;i++) if(S1[i]<0) all[now++]=S1[i]; for(i=0;i<N/2;i++) { for(j=2*i;j<N;j++) { if(S1[j]==all[i]) { for(k=j;k>2*i;k--) { ans2++; swap(S1[k],S1[k-1]); } break; } } for(j=2*i+1;j<N;j++) { if(S1[j]==0-all[i]) { for(k=j;k>2*i+1;k--) { ans2++; swap(S1[k],S1[k-1]); } } break; } } return min(ans1,ans2); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 256 KB | Output is correct |
2 | Correct | 2 ms | 256 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 256 KB | Output is correct |
2 | Correct | 2 ms | 256 KB | Output is correct |
3 | Incorrect | 2 ms | 256 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 256 KB | Output is correct |
2 | Correct | 2 ms | 256 KB | Output is correct |
3 | Incorrect | 2 ms | 376 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Incorrect | 2 ms | 380 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 256 KB | Output is correct |
2 | Correct | 2 ms | 256 KB | Output is correct |
3 | Incorrect | 2 ms | 256 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 256 KB | Output is correct |
2 | Correct | 2 ms | 256 KB | Output is correct |
3 | Incorrect | 2 ms | 256 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |