Submission #436460

#TimeUsernameProblemLanguageResultExecution timeMemory
436460rGamerArranging Shoes (IOI19_shoes)C++17
10 / 100
1 ms288 KiB
#include <bits/stdc++.h> #define ll long long #define vi vector<int> using namespace std; ll count_swaps(vi s) { int n = s.size() / 2, ans = 0; if(n == 1) return (s[0] > 0); bool ok = true; for(int i = 1; i < 2 * n; ++i) if(abs(s[i]) != abs(s[0])) ok = false; if(ok) for(int i = 0; i < n; ++i) if(s[2 * i] > 0) ans++; return ans; }
#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...