제출 #596195

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
596195		Koosha_mv	Arranging Shoes (IOI19_shoes)	C++14	0 / 100	1106 ms	638952 KiB

shoes

#include "shoes.h"
#include <bits/stdc++.h>
using namespace std;
#define dbgv(v) cout<<#v<<" = "; f(i,0,int(v.size())) cout<<v[i]<<" "; cout<<endl
#define dbga(a,x,y) cout<<#a<<" = "; f(i,x,y) cout<<a[i]<<" "; cout<<endl
#define erorp(x) cout<<#x<<"={"<<x.F<<" , "<<x.S<<"}"<<endl
#define eror(x) cout<<#x<<'='<<(x)<<endl
#define f_(i,a,b) for(int i=a;i>=b;i--)
#define f(i,a,b) for(int i=a;i<b;i++)
#define nb(x) __builtin_popcount(x)
#define all(v) v.begin(),v.end()
#define bit(n,k) (((n)>>(k))&1)
#define Add(x,y) x=(x+y)%mod
#define maxm(a,b) a=max(a,b)
#define minm(a,b) a=min(a,b)
#define lst(x) x[x.size()-1]
#define sz(x) int(x.size())
#define mp make_pair
#define ll long long
#define pb push_back
#define S second
#define F first
 
const int N=2505,lg=10;
 
int n,a[N],L[N],R[N],fen[N];
ll ans;
vector<int> A[N],B[N],vec[N][N];

void add(int x,int val){
  for(x++;x>0;x-=(x&-x)){
    fen[x]+=val;
  }
}
int get(int x){
  int res=0;
  for(x++;x<N;x+=(x&-x)){
    res+=fen[x];
  }
  return res;
}
ll count_swaps(vector<int> D) {
  f(i,0,N){
    f(j,0,N){
      f(k,0,lg){
        vec[i][j].pb(k<<1);
      }
      //vec[i][j].clear();
      //vec[i][j].shrink_to_fit();
    }
  }
  return ans;
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 20
• Subtask 3: 0 / 20
• Subtask 4: 0 / 15
• Subtask 5: 0 / 20
• Subtask 6: 0 / 15