제출 #895463

#제출 시각아이디문제언어결과실행 시간메모리
895463ozner77Arranging Shoes (IOI19_shoes)C++17
0 / 100
1 ms348 KiB
#include "shoes.h" #include <bits/stdc++.h> #include <vector> #include <iostream> #include <string> using namespace std; long long count_swaps(std::vector<int> s) { int a,b,c,d,e=s.size(); long long swaps=0; a=s[0]; b=s[0]; for(int k=0;k<e;k+=2){ a=s[k]; b=s[k]; for(int i=k;i<e;i++){ if(s[i]<0){ swaps++; s[k]=s[i]; s[i]=a; c=s[k+1]; d=s[k+1]; for(int j=k+1;j<e;j++){ if(s[j]+s[k]==0){ s[k+1]=s[j]; s[j]=c; break; }else if(i>=k+2){ d=s[j]; s[j]=c; c=d; } } break; }else if(i>=k+1){ swaps++; b=s[i]; s[i]=a; a=b; } } } return swaps; }
#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...