Submission #169917

#TimeUsernameProblemLanguageResultExecution timeMemory
169917whtttArranging Shoes (IOI19_shoes)C++14
0 / 100
3 ms504 KiB
#include <vector>
#include <iostream>
#include <algorithm>
#define ll long long

using namespace std;

ll count_swaps(vector<int> S){
  	ll sol = 0;
  	while(1){
      	for(ll i = 1;;i++){
          	if(S[i] == -S[0]){
              	sol += i;
              	if(S[0] < 0){
                  	sol--;
                }
              	S.erase(S.begin()+i);
              	S.erase(S.begin());
              	break;
            }
        }
    }
  	return sol;
}

#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...