Submission #807010

#	Time	Username	Problem	Language	Result	Execution time	Memory
807010		TB_	Arranging Shoes (IOI19_shoes)	C++17	0 / 100	1 ms	300 KiB

shoes

#include <bits/stdc++.h>
using namespace std;


// #undef _GLIBCXX_DEBUG                // disable run-time bound checking, etc
// #pragma GCC optimize("Ofast,inline") // Ofast = O3,fast-math,allow-store-data-races,no-protect-parens
// #pragma GCC optimize ("unroll-loops")

// #pragma GCC target("bmi,bmi2,lzcnt,popcnt")                      // bit manipulation
// #pragma GCC target("movbe")                                      // byte swap
// #pragma GCC target("aes,pclmul,rdrnd")                           // encryption
// #pragma GCC target("avx,avx2,f16c,fma,sse3,ssse3,sse4.1,sse4.2") // SIMD

// #include <bits/extc++.h>
// using namespace __gnu_pbds;
// template<class T>using ordered_set = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;
// template<class T>using ordered_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define ll long long
#define INF (ll)1e9+7
#define fo(i, n) for(int i=0;i<((ll)n);i++)
#define deb(x) cout << #x << " = " << x << endl;
#define deb2(x, y) cout << #x << " = " << x << ", " << #y << " = " << y << endl
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define LSOne(S) ((S) & (-S))
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
inline int readint(){ int v = 0; char c; while((c = getchar()) != EOF && c != ' ' && c != '\n'){ v *= 10; v += c - '0'; } return v; }
inline int readintsigned() { int v = 0; int sign = 1; char c = getchar(); if (c == '-') { sign = -1; } else { v += c - '0'; } while ((c = getchar()) != EOF && c != ' ' && c != '\n') { v *= 10; v += c - '0'; } return v * sign; }
inline string readstring() { string s; char c; while ((c = getchar()) != EOF && c != '\n' && c != ' ') { s.push_back(c); } return s; }
template <class result_t=std::chrono::milliseconds,class clock_t=std::chrono::steady_clock,class duration_t = std::chrono::milliseconds>
auto since(std::chrono::time_point<clock_t, duration_t> const& start){return std::chrono::duration_cast<result_t>(clock_t::now() - start);}
typedef pair<int, int> pii;
typedef pair<ll, ll> pl;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vpii;
typedef vector<pl> vpl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef vector<vpii> vvpii;
typedef vector<vpl> vvpl;

struct Node{
	Node *lnode, *rnode;
	int n, l, r, val = 1;
	Node(int l, int r) : l(l), r(r){
		if(r-l > 1){
			int mid = (l+r) / 2;
			lnode = new Node(l, mid);
			rnode = new Node(mid, r);
			val = lnode->val+rnode->val;
		}
	}

	void update(int x){
		if(x>=r || x<l) return;
		if(r-l == 1) val = 0;
		lnode->update(x);
		rnode->update(x);
		val = lnode->val+rnode->val;
	}


	int query(int lo, int hi){
		if(hi <= l || r <= lo) return 0;
		if(lo <= l && r <= hi) return val;
		return lnode->query(lo, hi)+rnode->query(lo, hi);
	}

};

map<ll, vl> order;

ll count_swaps(vi s) {
	ll ans = 0;
	int n = s.size();

	vi used(n, 0);
	fo(i, n){
		order[s[i]].pb(i);
	}
	for(auto it : order){
		sort(rall(order[it.F]));
	}

	Node st(0, n);

	for(int pos = 0; pos < n; pos++){
		if(used[pos]) continue;
		if(s[pos] > 0) ans++;
		int coordinate = order[-s[pos]][order[-s[pos]].size()-1];
		order[-s[pos]].pop_back();
		order[s[pos]].pop_back();
		ans += st.query(pos+1, coordinate);
		st.update(coordinate);
		used[coordinate] = 1;
	}

	return ans;
}

// int main() {
// 	int n;
// 	assert(1 == scanf("%d", &n));
// 	vector<int> S(2 * n);
// 	for (int i = 0; i < 2 * n; i++)
// 		assert(1 == scanf("%d", &S[i]));
// 	fclose(stdin);

// 	long long result = count_swaps(S);

// 	printf("%lld\n", result);
// 	fclose(stdout);
// 	return 0;
// }

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