Submission #147392

#TimeUsernameProblemLanguageResultExecution timeMemory
147392mosiashvililukaArranging Shoes (IOI19_shoes)C++14
10 / 100
3 ms380 KiB
#include<bits/stdc++.h>
using namespace std;
long long a,b,c,d,e,f[200009];
long long count_swaps(vector <int> S){
	for(a=1; ; a++) if(S[a-1]==0) break;
	for(b=1; b<=a; b++) f[b]=S[b-1];
	if(f[1]<0) return 0LL; else return 1LL;
}
#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...