제출 #143109

#제출 시각아이디문제언어결과실행 시간메모리
143109daniel920712Arranging Shoes (IOI19_shoes)C++14
10 / 100
1050 ms1956 KiB
#include <iostream> #include <stdio.h> #include <vector> using namespace std; long long count_swaps(std::vector<int> S) { long long ans1=0,ans2=0,N=S.size(),i,j,k; int t; for(i=0;i<N/2;i++) { for(j=2*i;j<N;j++) { if(S[j]<0) { t=0-S[j]; for(k=j;k>2*i;k--) { ans1++; swap(S[k],S[k-1]); } break; } } for(j=2*i+1;j<N;j++) { if(S[j]==t) { for(k=j;k>2*i+1;k--) { ans1++; swap(S[k],S[k-1]); } break; } } } return ans1; }

컴파일 시 표준 에러 (stderr) 메시지

shoes.cpp: In function 'long long int count_swaps(std::vector<int>)':
shoes.cpp:8:22: warning: unused variable 'ans2' [-Wunused-variable]
     long long ans1=0,ans2=0,N=S.size(),i,j,k;
                      ^~~~
shoes.cpp:27:13: warning: 't' may be used uninitialized in this function [-Wmaybe-uninitialized]
             if(S[j]==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...