Submission #884666

#TimeUsernameProblemLanguageResultExecution timeMemory
884666tamir1Arranging Shoes (IOI19_shoes)C++14
10 / 100
71 ms134992 KiB
#include "shoes.h"
#include <queue>
using namespace std;
bool can(int x){
	if(x>0) return 1;
	return 0;
}
queue<int> q[200000];
long long count_swaps(vector<int> s) {
	long long result=0;
	
	
	if(s[0]<0) return result;
	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...