Submission #1189922

#TimeUsernameProblemLanguageResultExecution timeMemory
1189922h1440Arranging Shoes (IOI19_shoes)C++20
10 / 100
0 ms328 KiB
#include "shoes.h" #include <bits/stdc++.h> #define fore(i,a,b) for(lli i = (a), abcdxd = (b); i < abcdxd; i++) using namespace std; typedef long long lli; long long count_swaps(std::vector<int> s) { if (s[0] < 0) return 0; 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...