Submission #1144947

#TimeUsernameProblemLanguageResultExecution timeMemory
1144947MunkhturErdenebatArranging Shoes (IOI19_shoes)C++20
10 / 100
1103 ms250544 KiB
#include "shoes.h" #include<bits/stdc++.h> #include<string.h> #include <algorithm> #include <stdlib.h> #define ll int #define endl "\n" #define pb push_back using namespace std; ll a,b,c,d,e,f,m,i,j,n,h,g,l,k[200000],r,ka,p,q[200005],t[4100005]; map<ll,ll> maa,mii,mee; vector<ll> vas[200005],vis[200005],vii; pair<ll,ll> fgh; long long count_swaps(vector<int> s) { a=s.size(); h=0; for(i=0 ; i<a; i++){ if(maa[i]==1){ continue; } for(j=i+1 ; j<a; j++){ if(s[j]+s[i]==0 && maa[j]==0){ g=j; break; } } for(j=g-1 ; j>i; j++){ if(maa[j]==0){ h++; } } if(s[i]>0){ h++; } maa[g]=1; } return h; }
#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...