oj.uz

답안 #841725

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
841725 2023-09-02T00:44:23 Z Cookie Arranging Shoes (IOI19_shoes) C++14
100 / 100
 358 ms 149820 KB 
#include "shoes.h"
#include<bits/stdc++.h>
#include<fstream>

using namespace std;
//ifstream fin("FEEDING.INP");
//ofstream fout("FEEDING.OUT");
#define sz(a) (int)a.size()
#define ll long long
#define pb push_back
#define forr(i, a, b) for(int i = a; i < b; i++)
#define dorr(i, a, b) for(int i = a; i >= b; i--)
#define ld long double
#define vt vector
#include<fstream>
#define fi first
#define se second
#define pll pair<ll, ll>
#define pii pair<int, int>
const int mxn = 2e5 + 5;
using namespace std;
map<int, queue<int>>mp;
int bit[mxn + 1], to[mxn + 1], to2[mxn + 1];
bool vis[mxn + 1];
int n;
void upd(int p, int v){
    p++;
    while(p <= n){
        bit[p] += v; p += p & (-p);
    }
}
ll get(int p){
    p++;
    ll ans = 0;
    while(p){
        ans += bit[p]; p -= p & (-p);
    }
    return(ans);
}
ll count_swaps(vt<int>s){


    n = sz(s);
    for(int i = 0; i < sz(s); i++){
        if(s[i] < 0){
            if(mp[-s[i]].size()){
                int id = mp[-s[i]].front(); mp[-s[i]].pop();
                to[i] = id; to2[id] = i;
            }else{
                mp[s[i]].push(i);
            }

        }else{
            if(mp[-s[i]].size()){
                int id = mp[-s[i]].front();
                mp[-s[i]].pop();
                to[id] = i; to2[i] = id;
            }else{
                mp[s[i]].push(i);
            }

        }

    }
    ll ans =0 ;
    for(int i = 0; i < n; i++)upd(i, 1);
    for(int i = 0; i < sz(s); i++){
        if(!vis[i]){
            if(s[i] > 0){
                ans += get(to2[i] -1); upd(to2[i], -1);
                ans += get(i - 1); upd(i, -1);
                vis[to2[i]] = 1;
            }else{
                ans += get(i - 1); upd(i, -1);
                ans += get(to[i] -1); upd(to[i], -1);
                vis[to[i]] = 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 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2552 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 0 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 0 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 3 ms 2652 KB Output is correct
21 Correct 3 ms 2652 KB Output is correct
22 Correct 28 ms 5716 KB Output is correct
23 Correct 22 ms 5716 KB Output is correct
24 Correct 26 ms 5716 KB Output is correct
25 Correct 22 ms 5716 KB Output is correct
26 Correct 26 ms 5724 KB Output is correct
27 Correct 20 ms 5408 KB Output is correct
28 Correct 22 ms 5972 KB Output is correct
29 Correct 22 ms 5980 KB Output is correct
30 Correct 22 ms 5972 KB Output is correct
31 Correct 27 ms 6224 KB Output is correct
32 Correct 22 ms 5980 KB Output is correct
33 Correct 23 ms 5716 KB Output is correct
34 Correct 22 ms 5972 KB Output is correct
35 Correct 1 ms 2396 KB Output is correct
36 Correct 1 ms 2396 KB Output is correct
37 Correct 22 ms 5980 KB Output is correct
38 Correct 23 ms 5980 KB Output is correct
39 Correct 23 ms 5980 KB Output is correct

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 343 ms 149588 KB Output is correct
6 Correct 88 ms 18260 KB Output is correct
7 Correct 310 ms 149588 KB Output is correct
8 Correct 25 ms 5972 KB Output is correct
9 Correct 315 ms 149724 KB Output is correct
10 Correct 233 ms 77652 KB Output is correct

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 1 ms 2552 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 1 ms 2552 KB Output is correct
22 Correct 1 ms 2396 KB Output is correct
23 Correct 1 ms 2396 KB Output is correct
24 Correct 1 ms 2396 KB Output is correct
25 Correct 1 ms 2396 KB Output is correct
26 Correct 1 ms 2396 KB Output is correct
27 Correct 1 ms 2396 KB Output is correct
28 Correct 1 ms 2396 KB Output is correct
29 Correct 1 ms 2396 KB Output is correct
30 Correct 1 ms 2648 KB Output is correct
31 Correct 1 ms 2396 KB Output is correct
32 Correct 1 ms 2396 KB Output is correct
33 Correct 1 ms 2396 KB Output is correct
34 Correct 1 ms 2396 KB Output is correct
35 Correct 1 ms 2396 KB Output is correct
36 Correct 1 ms 2396 KB Output is correct
37 Correct 1 ms 2396 KB Output is correct
38 Correct 1 ms 2396 KB Output is correct
39 Correct 1 ms 2396 KB Output is correct
40 Correct 1 ms 2652 KB Output is correct
41 Correct 2 ms 3932 KB Output is correct
42 Correct 2 ms 3932 KB Output is correct
43 Correct 2 ms 3676 KB Output is correct
44 Correct 2 ms 3420 KB Output is correct
45 Correct 2 ms 3420 KB Output is correct
46 Correct 1 ms 3164 KB Output is correct
47 Correct 1 ms 2908 KB Output is correct
48 Correct 1 ms 2908 KB Output is correct
49 Correct 1 ms 2652 KB Output is correct
50 Correct 1 ms 2396 KB Output is correct
51 Correct 1 ms 2396 KB Output is correct
52 Correct 2 ms 3932 KB Output is correct

Subtask #6
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 1 ms 2552 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 1 ms 2552 KB Output is correct
22 Correct 1 ms 2396 KB Output is correct
23 Correct 1 ms 2396 KB Output is correct
24 Correct 1 ms 2396 KB Output is correct
25 Correct 1 ms 2396 KB Output is correct
26 Correct 1 ms 2396 KB Output is correct
27 Correct 1 ms 2396 KB Output is correct
28 Correct 1 ms 2396 KB Output is correct
29 Correct 1 ms 2396 KB Output is correct
30 Correct 1 ms 2648 KB Output is correct
31 Correct 1 ms 2396 KB Output is correct
32 Correct 1 ms 2396 KB Output is correct
33 Correct 1 ms 2396 KB Output is correct
34 Correct 1 ms 2396 KB Output is correct
35 Correct 1 ms 2396 KB Output is correct
36 Correct 1 ms 2396 KB Output is correct
37 Correct 1 ms 2396 KB Output is correct
38 Correct 1 ms 2552 KB Output is correct
39 Correct 1 ms 2396 KB Output is correct
40 Correct 1 ms 2396 KB Output is correct
41 Correct 1 ms 2396 KB Output is correct
42 Correct 1 ms 2396 KB Output is correct
43 Correct 0 ms 2396 KB Output is correct
44 Correct 1 ms 2396 KB Output is correct
45 Correct 1 ms 2396 KB Output is correct
46 Correct 1 ms 2396 KB Output is correct
47 Correct 1 ms 2396 KB Output is correct
48 Correct 0 ms 2396 KB Output is correct
49 Correct 1 ms 2396 KB Output is correct
50 Correct 1 ms 2396 KB Output is correct
51 Correct 1 ms 2396 KB Output is correct
52 Correct 1 ms 2396 KB Output is correct
53 Correct 1 ms 2396 KB Output is correct
54 Correct 3 ms 2652 KB Output is correct
55 Correct 3 ms 2652 KB Output is correct
56 Correct 28 ms 5716 KB Output is correct
57 Correct 22 ms 5716 KB Output is correct
58 Correct 26 ms 5716 KB Output is correct
59 Correct 22 ms 5716 KB Output is correct
60 Correct 26 ms 5724 KB Output is correct
61 Correct 20 ms 5408 KB Output is correct
62 Correct 22 ms 5972 KB Output is correct
63 Correct 22 ms 5980 KB Output is correct
64 Correct 22 ms 5972 KB Output is correct
65 Correct 27 ms 6224 KB Output is correct
66 Correct 22 ms 5980 KB Output is correct
67 Correct 23 ms 5716 KB Output is correct
68 Correct 22 ms 5972 KB Output is correct
69 Correct 1 ms 2396 KB Output is correct
70 Correct 1 ms 2396 KB Output is correct
71 Correct 22 ms 5980 KB Output is correct
72 Correct 23 ms 5980 KB Output is correct
73 Correct 23 ms 5980 KB Output is correct
74 Correct 1 ms 2396 KB Output is correct
75 Correct 1 ms 2396 KB Output is correct
76 Correct 1 ms 2396 KB Output is correct
77 Correct 1 ms 2396 KB Output is correct
78 Correct 343 ms 149588 KB Output is correct
79 Correct 88 ms 18260 KB Output is correct
80 Correct 310 ms 149588 KB Output is correct
81 Correct 25 ms 5972 KB Output is correct
82 Correct 315 ms 149724 KB Output is correct
83 Correct 233 ms 77652 KB Output is correct
84 Correct 1 ms 2396 KB Output is correct
85 Correct 1 ms 2396 KB Output is correct
86 Correct 1 ms 2396 KB Output is correct
87 Correct 1 ms 2652 KB Output is correct
88 Correct 2 ms 3932 KB Output is correct
89 Correct 2 ms 3932 KB Output is correct
90 Correct 2 ms 3676 KB Output is correct
91 Correct 2 ms 3420 KB Output is correct
92 Correct 2 ms 3420 KB Output is correct
93 Correct 1 ms 3164 KB Output is correct
94 Correct 1 ms 2908 KB Output is correct
95 Correct 1 ms 2908 KB Output is correct
96 Correct 1 ms 2652 KB Output is correct
97 Correct 1 ms 2396 KB Output is correct
98 Correct 1 ms 2396 KB Output is correct
99 Correct 2 ms 3932 KB Output is correct
100 Correct 2 ms 3932 KB Output is correct
101 Correct 17 ms 15584 KB Output is correct
102 Correct 9 ms 5544 KB Output is correct
103 Correct 344 ms 149820 KB Output is correct
104 Correct 275 ms 149588 KB Output is correct
105 Correct 223 ms 87456 KB Output is correct
106 Correct 315 ms 149584 KB Output is correct
107 Correct 87 ms 21588 KB Output is correct
108 Correct 109 ms 37552 KB Output is correct
109 Correct 23 ms 5972 KB Output is correct
110 Correct 22 ms 5972 KB Output is correct
111 Correct 298 ms 133460 KB Output is correct
112 Correct 285 ms 117588 KB Output is correct
113 Correct 99 ms 23380 KB Output is correct
114 Correct 358 ms 149560 KB Output is correct
115 Correct 323 ms 149588 KB Output is correct