Submission #143411

#TimeUsernameProblemLanguageResultExecution timeMemory
143411daniel920712Arranging Shoes (IOI19_shoes)C++14
10 / 100
2 ms380 KiB
#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 (stderr)

shoes.cpp: In function 'long long int count_swaps(std::vector<int>)':
shoes.cpp:16:29: warning: unused variable 'ans3' [-Wunused-variable]
     long long ans1=0,ans2=0,ans3=0,ans4=0,N=S.size(),i,j,k,now=0;
                             ^~~~
shoes.cpp:16:36: warning: unused variable 'ans4' [-Wunused-variable]
     long long ans1=0,ans2=0,ans3=0,ans4=0,N=S.size(),i,j,k,now=0;
                                    ^~~~
shoes.cpp:17:15: warning: unused variable 't' [-Wunused-variable]
     long long t;
               ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...