Submission #952673

#TimeUsernameProblemLanguageResultExecution timeMemory
952673batsukh2006Arranging Shoes (IOI19_shoes)C++17
0 / 100
15 ms3136 KiB
#include<iostream> #include<stdio.h> #include<math.h> #include<map> #include<string> #include<algorithm> #include<vector> #include<string.h> #include<utility> #include<set> #include<cmath> #include<queue> #include<deque> #include<functional> #include<stack> #include<limits.h> #include<iomanip> #include<unordered_map> #include "shoes.h" using namespace std; long long count_swaps(vector<int> s){ int n=s.size()/2; return n*(n-1)/2; } // signed main(){ // // freopen("hps.in", "r", stdin); // // freopen("hps.out", "w", stdout); // ios::sync_with_stdio(0); // cin.tie(0); // cout.tie(0); // int t=1; // // cin>>t; // while(t--){ // solve(); // cout<<endl; // } // 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...