oj.uz

Submission #251532

# Submission time Handle Problem Language Result Execution time Memory
251532 2020-07-21T17:30:12 Z ryansee Arranging Shoes (IOI19_shoes) C++14
100 / 100
 330 ms 191720 KB 
#include "shoes.h"

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

#define FAST ios_base::sync_with_stdio(false); cin.tie(0);
#define pb push_back
#define eb emplace_back
#define ins insert
#define f first
#define s second
#define cbr cerr<<"hi\n"
#define mmst(x, v) memset((x), v, sizeof ((x)))
#define siz(x) ll(x.size())
#define all(x) (x).begin(), (x).end()
#define lbd(x,y) (lower_bound(all(x),y)-x.begin())
#define ubd(x,y) (upper_bound(all(x),y)-x.begin())
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());    //can be used by calling rng() or shuffle(A, A+n, rng)
inline long long rand(long long x, long long y) { return rng() % (y+1-x) + x; } //inclusivesss
string inline to_string(char c) {string s(1,c);return s;} template<typename T> inline T gcd(T a,T b){ return a==0?llabs(b):gcd(b%a,a); }

using ll=long long; 
using ld=long double;
#define FOR(i,s,e) for(ll i=s;i<=ll(e);++i)
#define DEC(i,s,e) for(ll i=s;i>=ll(e);--i)
using pi=pair<ll,ll>; using spi=pair<ll,pi>; using dpi=pair<pi,pi>; 

#define LLINF ((long long)1e18)
#define INF int(1e9+1e6)
#define MAXN (200006)
ll n, fw[MAXN];
void update(int x,ll nval){
	++ x;
	for(;x<MAXN;x+=x&(-x)) fw[x]+=nval;
}
ll sum(int x){
	++ x;
	ll res=0;
	for(;x;x-=x&(-x)) res+=fw[x];
	return res;
}
long long count_swaps(std::vector<int> A) {
	ll n=A.size()/2, ans = 0;
	deque<deque<deque<ll>>> sz(n+1, deque<deque<ll>>(2, deque<ll>()));
	vector<pi> e;
	vector<ll> v(2*n,0);
	FOR(i,0,2*n-1){
		bool R = A[i]>0;
		ll x=abs(A[i]);
		sz[x][R].eb(i);
		if(sz[x][0].size()&&sz[x][1].size()){
			e.eb(sz[x][0][0],sz[x][1][0]),sz[x][0].pop_front(), sz[x][1].pop_front();
		}
	}
	assert(e.size() == n);
	FOR(i,0,n-1)A[e[i].f]=-(i+1), A[e[i].s]=i+1;
	for(auto i:e){
		ll a=i.f,b=i.s;
		if(a>b)swap(a,b), ++ans;
		v[b]=v[a]=a;
	}
	FOR(i,0,2*n-1){
		if(v[i] ^ i) ans += sum(MAXN-2) - sum(v[i]);
		update(v[i], 1);
	}
	return ans;
}

Compilation message

In file included from /usr/include/c++/7/cassert:44:0,
                 from /usr/include/x86_64-linux-gnu/c++/7/bits/stdc++.h:33,
                 from shoes.cpp:3:
shoes.cpp: In function 'long long int count_swaps(std::vector<int>)':
shoes.cpp:55:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  assert(e.size() == n);
         ~~~~~~~~~^~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 512 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 512 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 0 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 0 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 0 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 0 ms 384 KB Output is correct
22 Correct 0 ms 384 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 0 ms 384 KB Output is correct
26 Correct 0 ms 384 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 0 ms 384 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 0 ms 384 KB Output is correct
31 Correct 0 ms 384 KB Output is correct
32 Correct 0 ms 384 KB Output is correct
33 Correct 0 ms 384 KB Output is correct
34 Correct 0 ms 384 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 0 ms 384 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 512 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 0 ms 384 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 1 ms 512 KB Output is correct
16 Correct 1 ms 512 KB Output is correct
17 Correct 1 ms 896 KB Output is correct
18 Correct 2 ms 2304 KB Output is correct
19 Correct 2 ms 2304 KB Output is correct
20 Correct 20 ms 19584 KB Output is correct
21 Correct 20 ms 19588 KB Output is correct
22 Correct 198 ms 191568 KB Output is correct
23 Correct 195 ms 191596 KB Output is correct
24 Correct 203 ms 191544 KB Output is correct
25 Correct 200 ms 191464 KB Output is correct
26 Correct 205 ms 191596 KB Output is correct
27 Correct 201 ms 191340 KB Output is correct
28 Correct 201 ms 191592 KB Output is correct
29 Correct 196 ms 191556 KB Output is correct
30 Correct 198 ms 191720 KB Output is correct
31 Correct 204 ms 191596 KB Output is correct
32 Correct 196 ms 191596 KB Output is correct
33 Correct 258 ms 191596 KB Output is correct
34 Correct 248 ms 191612 KB Output is correct
35 Correct 0 ms 384 KB Output is correct
36 Correct 0 ms 384 KB Output is correct
37 Correct 193 ms 191592 KB Output is correct
38 Correct 191 ms 191592 KB Output is correct
39 Correct 200 ms 191592 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 330 ms 190704 KB Output is correct
6 Correct 229 ms 190824 KB Output is correct
7 Correct 255 ms 190852 KB Output is correct
8 Correct 206 ms 191592 KB Output is correct
9 Correct 259 ms 190700 KB Output is correct
10 Correct 280 ms 190704 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 512 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 0 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 0 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 0 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 0 ms 384 KB Output is correct
22 Correct 0 ms 384 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 0 ms 384 KB Output is correct
26 Correct 0 ms 384 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 0 ms 384 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 0 ms 384 KB Output is correct
31 Correct 0 ms 384 KB Output is correct
32 Correct 0 ms 384 KB Output is correct
33 Correct 0 ms 384 KB Output is correct
34 Correct 0 ms 384 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 0 ms 384 KB Output is correct
37 Correct 1 ms 384 KB Output is correct
38 Correct 1 ms 384 KB Output is correct
39 Correct 1 ms 512 KB Output is correct
40 Correct 1 ms 896 KB Output is correct
41 Correct 2 ms 2304 KB Output is correct
42 Correct 2 ms 2304 KB Output is correct
43 Correct 2 ms 2304 KB Output is correct
44 Correct 3 ms 2304 KB Output is correct
45 Correct 2 ms 2304 KB Output is correct
46 Correct 2 ms 2304 KB Output is correct
47 Correct 2 ms 2304 KB Output is correct
48 Correct 2 ms 2304 KB Output is correct
49 Correct 2 ms 2304 KB Output is correct
50 Correct 2 ms 2304 KB Output is correct
51 Correct 2 ms 2304 KB Output is correct
52 Correct 2 ms 2304 KB Output is correct

Subtask #6
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 512 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 0 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 0 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 0 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 0 ms 384 KB Output is correct
22 Correct 0 ms 384 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 0 ms 384 KB Output is correct
26 Correct 0 ms 384 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 0 ms 384 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 0 ms 384 KB Output is correct
31 Correct 0 ms 384 KB Output is correct
32 Correct 0 ms 384 KB Output is correct
33 Correct 0 ms 384 KB Output is correct
34 Correct 0 ms 384 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 0 ms 384 KB Output is correct
37 Correct 0 ms 384 KB Output is correct
38 Correct 0 ms 384 KB Output is correct
39 Correct 0 ms 384 KB Output is correct
40 Correct 0 ms 384 KB Output is correct
41 Correct 0 ms 384 KB Output is correct
42 Correct 0 ms 384 KB Output is correct
43 Correct 0 ms 384 KB Output is correct
44 Correct 0 ms 384 KB Output is correct
45 Correct 0 ms 384 KB Output is correct
46 Correct 0 ms 384 KB Output is correct
47 Correct 0 ms 384 KB Output is correct
48 Correct 0 ms 384 KB Output is correct
49 Correct 1 ms 512 KB Output is correct
50 Correct 1 ms 512 KB Output is correct
51 Correct 1 ms 896 KB Output is correct
52 Correct 2 ms 2304 KB Output is correct
53 Correct 2 ms 2304 KB Output is correct
54 Correct 20 ms 19584 KB Output is correct
55 Correct 20 ms 19588 KB Output is correct
56 Correct 198 ms 191568 KB Output is correct
57 Correct 195 ms 191596 KB Output is correct
58 Correct 203 ms 191544 KB Output is correct
59 Correct 200 ms 191464 KB Output is correct
60 Correct 205 ms 191596 KB Output is correct
61 Correct 201 ms 191340 KB Output is correct
62 Correct 201 ms 191592 KB Output is correct
63 Correct 196 ms 191556 KB Output is correct
64 Correct 198 ms 191720 KB Output is correct
65 Correct 204 ms 191596 KB Output is correct
66 Correct 196 ms 191596 KB Output is correct
67 Correct 258 ms 191596 KB Output is correct
68 Correct 248 ms 191612 KB Output is correct
69 Correct 0 ms 384 KB Output is correct
70 Correct 0 ms 384 KB Output is correct
71 Correct 193 ms 191592 KB Output is correct
72 Correct 191 ms 191592 KB Output is correct
73 Correct 200 ms 191592 KB Output is correct
74 Correct 0 ms 384 KB Output is correct
75 Correct 0 ms 384 KB Output is correct
76 Correct 1 ms 384 KB Output is correct
77 Correct 0 ms 384 KB Output is correct
78 Correct 330 ms 190704 KB Output is correct
79 Correct 229 ms 190824 KB Output is correct
80 Correct 255 ms 190852 KB Output is correct
81 Correct 206 ms 191592 KB Output is correct
82 Correct 259 ms 190700 KB Output is correct
83 Correct 280 ms 190704 KB Output is correct
84 Correct 1 ms 384 KB Output is correct
85 Correct 1 ms 384 KB Output is correct
86 Correct 1 ms 512 KB Output is correct
87 Correct 1 ms 896 KB Output is correct
88 Correct 2 ms 2304 KB Output is correct
89 Correct 2 ms 2304 KB Output is correct
90 Correct 2 ms 2304 KB Output is correct
91 Correct 3 ms 2304 KB Output is correct
92 Correct 2 ms 2304 KB Output is correct
93 Correct 2 ms 2304 KB Output is correct
94 Correct 2 ms 2304 KB Output is correct
95 Correct 2 ms 2304 KB Output is correct
96 Correct 2 ms 2304 KB Output is correct
97 Correct 2 ms 2304 KB Output is correct
98 Correct 2 ms 2304 KB Output is correct
99 Correct 2 ms 2304 KB Output is correct
100 Correct 2 ms 2304 KB Output is correct
101 Correct 23 ms 19584 KB Output is correct
102 Correct 21 ms 19588 KB Output is correct
103 Correct 287 ms 191600 KB Output is correct
104 Correct 229 ms 191472 KB Output is correct
105 Correct 237 ms 191596 KB Output is correct
106 Correct 267 ms 190816 KB Output is correct
107 Correct 215 ms 191596 KB Output is correct
108 Correct 221 ms 191596 KB Output is correct
109 Correct 192 ms 191720 KB Output is correct
110 Correct 191 ms 191592 KB Output is correct
111 Correct 251 ms 190828 KB Output is correct
112 Correct 267 ms 191596 KB Output is correct
113 Correct 222 ms 190828 KB Output is correct
114 Correct 248 ms 190828 KB Output is correct
115 Correct 251 ms 190828 KB Output is correct