제출 #1020012

#제출 시각아이디문제언어결과실행 시간메모리
1020012abdelhakimArranging Shoes (IOI19_shoes)C++14
25 / 100
24 ms3260 KiB
#include <bits/stdc++.h> #define mod 1000000007LL #define inf 1e17 #define ll long long using namespace std; void printvec(vector<ll> vec) { for (auto &&e : vec) { cout << e << ' '; } cout << endl; } ll count_swaps(vector<int> s) { ll n = s.size()/2; if(n == 1) return s[0] > s[1]; else return n*(n-1)/2; } // int main() // { // cout << count_swaps({-1,1}) << endl; // }
#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...