oj.uz

답안 #807048

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
807048 2023-08-04T12:49:21 Z TB_ Arranging Shoes (IOI19_shoes) C++17
100 / 100
 420 ms 44596 KB 
#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 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;
			return;
		}
		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
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 300 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 296 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 284 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 300 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 0 ms 300 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 1 ms 300 KB Output is correct
24 Correct 1 ms 300 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 300 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 304 KB Output is correct
30 Correct 1 ms 300 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 300 KB Output is correct
35 Correct 1 ms 296 KB Output is correct
36 Correct 1 ms 212 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 300 KB Output is correct
10 Correct 1 ms 296 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 6 ms 2644 KB Output is correct
21 Correct 6 ms 2644 KB Output is correct
22 Correct 66 ms 24364 KB Output is correct
23 Correct 52 ms 24220 KB Output is correct
24 Correct 64 ms 24240 KB Output is correct
25 Correct 61 ms 23956 KB Output is correct
26 Correct 59 ms 24284 KB Output is correct
27 Correct 50 ms 24088 KB Output is correct
28 Correct 60 ms 24208 KB Output is correct
29 Correct 60 ms 24196 KB Output is correct
30 Correct 58 ms 24212 KB Output is correct
31 Correct 60 ms 24300 KB Output is correct
32 Correct 59 ms 24196 KB Output is correct
33 Correct 59 ms 24092 KB Output is correct
34 Correct 60 ms 24208 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 62 ms 24228 KB Output is correct
38 Correct 59 ms 24240 KB Output is correct
39 Correct 62 ms 24208 KB Output is correct

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 300 KB Output is correct
5 Correct 305 ms 44592 KB Output is correct
6 Correct 133 ms 26540 KB Output is correct
7 Correct 292 ms 44588 KB Output is correct
8 Correct 67 ms 24228 KB Output is correct
9 Correct 307 ms 44596 KB Output is correct
10 Correct 209 ms 34108 KB Output is correct

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 300 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 296 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 284 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 300 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 0 ms 300 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 1 ms 300 KB Output is correct
24 Correct 1 ms 300 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 300 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 304 KB Output is correct
30 Correct 1 ms 300 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 300 KB Output is correct
35 Correct 1 ms 296 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 2 ms 724 KB Output is correct
42 Correct 2 ms 724 KB Output is correct
43 Correct 2 ms 596 KB Output is correct
44 Correct 2 ms 560 KB Output is correct
45 Correct 2 ms 596 KB Output is correct
46 Correct 2 ms 560 KB Output is correct
47 Correct 2 ms 596 KB Output is correct
48 Correct 1 ms 596 KB Output is correct
49 Correct 2 ms 560 KB Output is correct
50 Correct 1 ms 468 KB Output is correct
51 Correct 1 ms 468 KB Output is correct
52 Correct 2 ms 724 KB Output is correct

Subtask #6
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 300 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 296 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 284 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 300 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 0 ms 300 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 1 ms 300 KB Output is correct
24 Correct 1 ms 300 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 300 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 304 KB Output is correct
30 Correct 1 ms 300 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 300 KB Output is correct
35 Correct 1 ms 296 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 1 ms 212 KB Output is correct
41 Correct 1 ms 212 KB Output is correct
42 Correct 1 ms 212 KB Output is correct
43 Correct 1 ms 300 KB Output is correct
44 Correct 1 ms 296 KB Output is correct
45 Correct 1 ms 212 KB Output is correct
46 Correct 0 ms 212 KB Output is correct
47 Correct 1 ms 212 KB Output is correct
48 Correct 1 ms 212 KB Output is correct
49 Correct 1 ms 212 KB Output is correct
50 Correct 1 ms 212 KB Output is correct
51 Correct 1 ms 340 KB Output is correct
52 Correct 1 ms 468 KB Output is correct
53 Correct 1 ms 468 KB Output is correct
54 Correct 6 ms 2644 KB Output is correct
55 Correct 6 ms 2644 KB Output is correct
56 Correct 66 ms 24364 KB Output is correct
57 Correct 52 ms 24220 KB Output is correct
58 Correct 64 ms 24240 KB Output is correct
59 Correct 61 ms 23956 KB Output is correct
60 Correct 59 ms 24284 KB Output is correct
61 Correct 50 ms 24088 KB Output is correct
62 Correct 60 ms 24208 KB Output is correct
63 Correct 60 ms 24196 KB Output is correct
64 Correct 58 ms 24212 KB Output is correct
65 Correct 60 ms 24300 KB Output is correct
66 Correct 59 ms 24196 KB Output is correct
67 Correct 59 ms 24092 KB Output is correct
68 Correct 60 ms 24208 KB Output is correct
69 Correct 1 ms 212 KB Output is correct
70 Correct 1 ms 212 KB Output is correct
71 Correct 62 ms 24228 KB Output is correct
72 Correct 59 ms 24240 KB Output is correct
73 Correct 62 ms 24208 KB Output is correct
74 Correct 1 ms 212 KB Output is correct
75 Correct 1 ms 212 KB Output is correct
76 Correct 1 ms 212 KB Output is correct
77 Correct 1 ms 300 KB Output is correct
78 Correct 305 ms 44592 KB Output is correct
79 Correct 133 ms 26540 KB Output is correct
80 Correct 292 ms 44588 KB Output is correct
81 Correct 67 ms 24228 KB Output is correct
82 Correct 307 ms 44596 KB Output is correct
83 Correct 209 ms 34108 KB Output is correct
84 Correct 1 ms 212 KB Output is correct
85 Correct 1 ms 212 KB Output is correct
86 Correct 1 ms 340 KB Output is correct
87 Correct 1 ms 340 KB Output is correct
88 Correct 2 ms 724 KB Output is correct
89 Correct 2 ms 724 KB Output is correct
90 Correct 2 ms 596 KB Output is correct
91 Correct 2 ms 560 KB Output is correct
92 Correct 2 ms 596 KB Output is correct
93 Correct 2 ms 560 KB Output is correct
94 Correct 2 ms 596 KB Output is correct
95 Correct 1 ms 596 KB Output is correct
96 Correct 2 ms 560 KB Output is correct
97 Correct 1 ms 468 KB Output is correct
98 Correct 1 ms 468 KB Output is correct
99 Correct 2 ms 724 KB Output is correct
100 Correct 2 ms 724 KB Output is correct
101 Correct 19 ms 4480 KB Output is correct
102 Correct 17 ms 3112 KB Output is correct
103 Correct 420 ms 44596 KB Output is correct
104 Correct 295 ms 44492 KB Output is correct
105 Correct 270 ms 35432 KB Output is correct
106 Correct 291 ms 44476 KB Output is correct
107 Correct 143 ms 27088 KB Output is correct
108 Correct 164 ms 29236 KB Output is correct
109 Correct 62 ms 24388 KB Output is correct
110 Correct 60 ms 24240 KB Output is correct
111 Correct 279 ms 42060 KB Output is correct
112 Correct 364 ms 39792 KB Output is correct
113 Correct 166 ms 27232 KB Output is correct
114 Correct 293 ms 44596 KB Output is correct
115 Correct 316 ms 44492 KB Output is correct