제출 #143086

#제출 시각아이디문제언어결과실행 시간메모리
143086daniel920712Arranging Shoes (IOI19_shoes)C++14
0 / 100
1061 ms1916 KiB
#include <iostream> #include <stdio.h> #include <vector> using namespace std; long long count_swaps(std::vector<int> S) { long long ans=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) { ans+=(j-2*i); t=0-S[j]; for(k=j;k>2*i;k--) swap(S[k],S[k-1]); break; } } for(j=2*i+1;j<N;j++) { if(S[j]==t) { ans+=(j-2*i-1); t=0-S[j]; for(k=j;k>2*i+1;k--) swap(S[k],S[k-1]); break; } } /*for(j=0;j<N;j++) printf("%d ",S[j]); printf("\n");*/ } ans=(N/2)*(N/2-1)/2; return ans; }

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

shoes.cpp: In function 'long long int count_swaps(std::vector<int>)':
shoes.cpp:27:18: warning: 't' may be used uninitialized in this function [-Wmaybe-uninitialized]
                 t=0-S[j];
#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...