Submission #876434

#	Time	Username	Problem	Language	Result	Execution time	Memory
876434		Elvin_Fritl	Arranging Shoes (IOI19_shoes)	C++17	10 / 100	778 ms	1048576 KiB

shoes

#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
 
const int N = 2e5 + 545 , inf = 1e9 + 12 , mod = 1e9 + 7;
 
     #include "shoes.h"
 
struct segtree {
	int tree[N*4] ;
	void built(int v,int l,int r) {
		if(l == r) {
			tree[v] = 1;
			return;
		}
		int mid = (l + r)/2;
		built(v*2 , l , mid);
		built(v*2 + 1 , mid+1 , r);
		tree[v] = tree[v*2] + tree[v*2 + 1];
	}
	void update(int v,int l,int r,int ml,int val) {
		if(r < ml || ml < l) {
			return;
		}
		if(l == r && ml == l) {
			tree[v] += val;
			return;
		}
		int mid = (l + r)/2;
		update(v , l , mid , ml , val);
		update(v , mid + 1 , r , ml , val);
		tree[v] = tree[v*2] + tree[v*2 + 1];
	}
	int get(int v,int l,int r,int ml,int mr) {
		if(r < ml && mr < l) {
			return 0;
		}
		if(ml <= l && r <= mr) {
			return tree[v];
		}
		int mid = (l + r)/2;
		return (get(v , l , mid , ml , mr) + get(v , mid + 1 , r , ml ,mr));
	}
};
 
segtree S;
 
ll count_swaps(vector<int> v) {
	int n = v.size()/2;
	set<pair<int , int>> s;
	v.push_back(0);
	for(int i = 2*n;i>=1;i--){
		v[i] = v[i-1];
		s.insert({v[i] , i});
	}
	///cerr << "true1\n";
	S.built(1,1,2*n);
	int res = 0;
	for(int i=1;i<=2*n;i++) {
		if(s.find({v[i] , i}) != s.end()){
			auto it = s.lower_bound({-v[i] , i});
            if(it == s.end()){
              while(true);
            }
			if((*it).second - 2 >= i) {
				res += S.get(1,1,2*n,i + 1,(*it).second-1);
			}
			if(v[i] > 0) {
				res++;
			}
			S.update(1 , 1 , 2*n , i + 1 , -1);
			S.update(1 , 1 , 2*n , (*it).second + 1, -1);
			if(s.find({v[i], i}) != s.end()){
				s.erase(s.find({v[i], i}));
			}
          else{
            while(true);
          }
			if(s.find({-v[i],(*it).second}) != s.end()){
				s.erase(s.find({-v[i], (*it).second}));
			}
          else{
            while(true);
          }
		}
	}
	return res;
}

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