제출 #1355666

#제출 시각아이디문제언어결과실행 시간메모리
1355666coderg300711Arranging Shoes (IOI19_shoes)C++20
50 / 100
1096 ms1960 KiB
#include "bits/stdc++.h"
using namespace std;
#define fi first
#define se second
#define mp make_pair
#define pii pair<int,int>
#define yes cout<<"YES\n"
#define no cout<<"NO\n"
#define pb push_back
#define sz(x) (int)(x).size()
#define rsz resize
#define ass assign
#define F(i,l,r) for(int i=(l);i<(r);++i)
typedef long long ll;
typedef unsigned long long ull;
typedef long double lld;
//template<typename T> using pqg = priority_queue<T, vector<T>, greater<T>>;
#define each(a,x) for(auto a:x)
#define FOR(i,a) for(int i=0;i<(a);i++)
#define ROF(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define eb emplace_back
#define ft front()
#define V vector

#include "shoes.h"

ll count_swaps(V<int> s){
	 int n=sz(s);
      ll res=0;
      for(int i=0;i<n;i+=2){
            int id=-1;
            F(j,i+1,n){
                  if(-s[j]==s[i]){
                        id=j;
                        break;
                  }
            }
            while(id!=i+1){
                  res++;
                  swap(s[id],s[id-1]);
                  id--;
            }
            if(s[i]>0){
                  res++;
                  swap(s[i],s[i+1]);
            }
      }
      return res;
}
#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...