제출 #297378

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
297378		shayan_p	Arranging Shoes (IOI19_shoes)	C++17	0 / 100	1 ms	288 KiB

shoes

#include<bits/stdc++.h>
#include "shoes.h"

#define F first
#define S second
#define PB push_back
#define sz(s) (int(s.size()))
#define bit(n, k) (((n)>>(k))&1)

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;

const int maxn = 1e5 + 10;

int cnt[maxn];
ll sum, sumabs;

void add(int pos, int x){
    sum-= cnt[pos];
    sumabs-= abs(cnt[pos]);
    cnt[pos]+= x;
    sum+= cnt[pos];
    sumabs+= abs(cnt[pos]);
}

ll count_swaps(vector<int> a){
    ll ans = 0;
    int POS = 0;    
    for(int x : a){
	if(x < 0){
	    add(cnt[-x], -1);
	}
	else{
	    add(cnt[x], 1);
	}
	ll df = sumabs;
	ans+= sumabs;
	if(sum & 1){
	    if(sum == sumabs)
		ans++, df++;
	    else
		ans--, df--;
	}
	cout << POS << " " << df << endl;
	POS++;
    }
    return ans / 2;
}

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