제출 #879929

#제출 시각아이디문제언어결과실행 시간메모리
879929grafffArranging Shoes (IOI19_shoes)C++17
0 / 100
0 ms348 KiB
#include <bits/stdc++.h> #define ll int using namespace std; ll n; bool gr3(vector <ll> s) { ll k = abs(s[0]); for(int i = 2; i < n * 2; i++) { if(abs(s[i]) != k) { return false; } } return true; } ll f3(vector <ll> s) { ll k = 0; for(int i = 0; i < n; i++) { if(s[i * 2] > 0) { k++; } } return k; } ll count_swaps(vector <ll> s) { n = s.size() % 2; if(n == 1) { if(s[0] < 0) { return 0; } else { return 1; } } if(gr3(s)) { return f3(s); } return 0; }
#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...