Submission #824494

#	Time	Username	Problem	Language	Result	Execution time	Memory
824494		caganyanmaz	Arranging Shoes (IOI19_shoes)	C++17	25 / 100	19 ms	3132 KiB

shoes

#include <bits/stdc++.h>
#define mp(x...) array<int, 2>({x})
#define pb push_back
#define int int64_t
#define vi vector<int32_t> 
using namespace std;
#include "shoes.h"

constexpr static int MXSIZE = 1e6;

struct Fenwick
{
	int v[MXSIZE];
	void set(int i, int val) { for (++i;i<MXSIZE;i+=i&(-i)) v[i] += val; }
	int get(int i) { int res = 0; for(++i;i>0;i-=i&(-i)) res += v[i]; return res; }
};

int subtask1(vi& s)
{
	if (s[0] > 0)
		return 1;
	else
		return 0;
}

Fenwick fw;
int last[MXSIZE];
map<int, int> pos;
int subtask4(vi& s)
{
	int n = s.size() / 2;
	return n * (n-1) / 2;
}

long long count_swaps(vi s)
{
	if (s.size() == 2)
		return subtask1(s);
	return subtask4(s);
	
}

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