제출 #211037

#제출 시각아이디문제언어결과실행 시간메모리
211037_Ice_Tea_Arranging Shoes (IOI19_shoes)C++14
0 / 100
5 ms384 KiB
#include<bits/stdc++.h> #define LLI long long int #define pii pair<int,int> #define fst first #define sec second #define ULTRA 2134567890 #define de(x) if(x!=0 && MODE==x) #define MODE 1 using namespace std; int count_swaps( vector<int> S) { if( S[0] > 0) return 0; else return -1; }
#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...