oj.uz

답안 #144525

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
144525 2019-08-17T04:37:15 Z dndhk Arranging Shoes (IOI19_shoes) C++14
100 / 100
 188 ms 18524 KB 
#include "shoes.h"
#include <bits/stdc++.h>

#define pb push_back
#define all(v) ((v).begin(), (v).end())
#define sortv(v) sort(all(v))
#define sz(v) ((int)(v).size())
#define uniqv(v) (v).erase(unique(all(v)), (v).end())
#define umax(a, b) (a)=max((a), (b))
#define umin(a, b) (a)=min((a), (b))
#define FOR(i,a,b) for(int i = (a); i <= (b); i++)
#define rep(i,n) FOR(i,1,n)
#define rep0(i,n) FOR(i,0,(int)(n)-1)
#define FI first
#define SE second
#define INF 2000000000
#define INFLL 1000000000000000000LL


using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int MAX_N = 100000;

int N;
vector<int> vt[2][MAX_N+1];
int l[MAX_N+1], r[MAX_N+1];
bool chk[MAX_N+1];

struct SEG{
    struct NODE{
        int l, r;
        int sum;
    };
    int SZ;
    vector<NODE> seg;
    void Init(int x){
        SZ = x;
        seg.pb({-1, -1, 0});
        init(0, 0, SZ-1);
    }
    void init(int idx, int s, int e){
        if(s==e)    return;
        seg[idx].l = seg.size(); seg.pb({-1, -1, 0});
        seg[idx].r = seg.size(); seg.pb({-1, -1, 0});
        init(seg[idx].l, s, (s+e)/2); init(seg[idx].r, (s+e)/2+1, e);
    }
    void Update(int x, int y){
        update(0, 0, SZ-1, x, y);
    }
    void update(int idx, int s, int e, int x, int y){
        seg[idx].sum+=y;
        if(s==e)    return;
        if(x<=(s+e)/2)    update(seg[idx].l, s, (s+e)/2, x, y);
        else    update(seg[idx].r, (s+e)/2+1, e, x, y);
    }
    int Sum(int x, int y){
        return sum(0, 0, SZ-1, x, y);
    }
    int sum(int idx, int s, int e, int x, int y){
        if(x<=s && e<=y)    return seg[idx].sum;
        else if(x>e || y<s)    return 0;
        return sum(seg[idx].l, s, (s+e)/2, x, y) + sum(seg[idx].r, (s+e)/2+1, e, x, y);
    }
};

SEG Seg;

int zero(int x){
    return (x>0) ? x : -x;
}
long long count_swaps(std::vector<int> S) {
    N = S.size();
    Seg.Init(N);
    for(int i=0; i<N; i++){
        Seg.Update(i+1, 1);
        if(S[i]<0){
            vt[0][-S[i]].pb(i);
        }else{
            vt[1][S[i]].pb(i);
        }
    }
    int idx = 1;
    for(int i=1; i<=N/2; i++){
        while(!vt[1][i].empty()){
            r[idx] = vt[1][i].back();
            l[idx] = vt[0][i].back();
            S[vt[1][i].back()] = idx;
            S[vt[0][i].back()] = -idx;
            idx++; vt[1][i].pop_back(); vt[0][i].pop_back();
        }
    }
    ll ans = 0;
    for(int i=0; i<N; i++){
        if(chk[zero(S[i])])    continue;
        int now = zero(S[i]); chk[now] = true;
        if(S[i]<0){
            ans += (ll)Seg.Sum(i+1, r[now]-1);
            Seg.Update(r[now], -1);
        }else{
            ans += (ll)Seg.Sum(i+1, l[now]-1);
            Seg.Update(l[now], -1);
            ans++;
        }
    }
    return ans;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 4984 KB Output is correct
2 Correct 6 ms 4984 KB Output is correct
3 Correct 7 ms 4988 KB Output is correct
4 Correct 6 ms 4984 KB Output is correct
5 Correct 6 ms 4984 KB Output is correct
6 Correct 6 ms 4984 KB Output is correct
7 Correct 6 ms 4984 KB Output is correct
8 Correct 6 ms 4984 KB Output is correct
9 Correct 6 ms 4984 KB Output is correct
10 Correct 6 ms 4984 KB Output is correct
11 Correct 6 ms 4984 KB Output is correct
12 Correct 6 ms 4984 KB Output is correct
13 Correct 6 ms 4984 KB Output is correct
14 Correct 6 ms 4984 KB Output is correct
15 Correct 6 ms 4984 KB Output is correct
16 Correct 6 ms 4984 KB Output is correct
17 Correct 6 ms 5112 KB Output is correct
18 Correct 7 ms 5112 KB Output is correct
19 Correct 7 ms 5112 KB Output is correct
20 Correct 43 ms 6004 KB Output is correct
21 Correct 15 ms 6012 KB Output is correct
22 Correct 96 ms 13788 KB Output is correct
23 Correct 85 ms 13404 KB Output is correct
24 Correct 94 ms 13660 KB Output is correct
25 Correct 95 ms 13528 KB Output is correct
26 Correct 96 ms 13396 KB Output is correct
27 Correct 84 ms 13404 KB Output is correct
28 Correct 96 ms 13532 KB Output is correct
29 Correct 96 ms 13680 KB Output is correct
30 Correct 95 ms 13532 KB Output is correct
31 Correct 96 ms 13400 KB Output is correct
32 Correct 95 ms 13404 KB Output is correct
33 Correct 94 ms 13532 KB Output is correct
34 Correct 97 ms 13540 KB Output is correct
35 Correct 6 ms 4984 KB Output is correct
36 Correct 6 ms 4984 KB Output is correct
37 Correct 97 ms 13404 KB Output is correct
38 Correct 96 ms 13544 KB Output is correct
39 Correct 96 ms 13660 KB Output is correct

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 4984 KB Output is correct
2 Correct 6 ms 4984 KB Output is correct
3 Correct 7 ms 4984 KB Output is correct
4 Correct 7 ms 4984 KB Output is correct
5 Correct 149 ms 18524 KB Output is correct
6 Correct 141 ms 13788 KB Output is correct
7 Correct 147 ms 18400 KB Output is correct
8 Correct 100 ms 13276 KB Output is correct
9 Correct 146 ms 18460 KB Output is correct
10 Correct 141 ms 15384 KB Output is correct

Subtask #5
20.0 / 20.0

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

Subtask #6
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 4984 KB Output is correct
2 Correct 6 ms 4984 KB Output is correct
3 Correct 6 ms 4984 KB Output is correct
4 Correct 6 ms 4988 KB Output is correct
5 Correct 6 ms 4984 KB Output is correct
6 Correct 6 ms 4988 KB Output is correct
7 Correct 6 ms 4984 KB Output is correct
8 Correct 6 ms 4984 KB Output is correct
9 Correct 6 ms 4984 KB Output is correct
10 Correct 6 ms 4984 KB Output is correct
11 Correct 6 ms 4984 KB Output is correct
12 Correct 6 ms 4984 KB Output is correct
13 Correct 6 ms 4984 KB Output is correct
14 Correct 6 ms 4984 KB Output is correct
15 Correct 6 ms 4984 KB Output is correct
16 Correct 6 ms 4984 KB Output is correct
17 Correct 6 ms 4984 KB Output is correct
18 Correct 8 ms 4984 KB Output is correct
19 Correct 6 ms 4984 KB Output is correct
20 Correct 6 ms 4984 KB Output is correct
21 Correct 6 ms 4984 KB Output is correct
22 Correct 6 ms 4984 KB Output is correct
23 Correct 6 ms 4984 KB Output is correct
24 Correct 6 ms 4984 KB Output is correct
25 Correct 6 ms 4984 KB Output is correct
26 Correct 6 ms 4984 KB Output is correct
27 Correct 6 ms 4984 KB Output is correct
28 Correct 6 ms 4984 KB Output is correct
29 Correct 6 ms 4984 KB Output is correct
30 Correct 6 ms 4984 KB Output is correct
31 Correct 6 ms 4988 KB Output is correct
32 Correct 6 ms 4984 KB Output is correct
33 Correct 6 ms 4984 KB Output is correct
34 Correct 6 ms 4984 KB Output is correct
35 Correct 6 ms 4984 KB Output is correct
36 Correct 6 ms 4984 KB Output is correct
37 Correct 7 ms 4988 KB Output is correct
38 Correct 6 ms 4984 KB Output is correct
39 Correct 6 ms 4984 KB Output is correct
40 Correct 6 ms 4984 KB Output is correct
41 Correct 6 ms 4984 KB Output is correct
42 Correct 6 ms 4984 KB Output is correct
43 Correct 6 ms 4984 KB Output is correct
44 Correct 6 ms 4984 KB Output is correct
45 Correct 6 ms 4984 KB Output is correct
46 Correct 6 ms 4984 KB Output is correct
47 Correct 6 ms 4984 KB Output is correct
48 Correct 6 ms 4984 KB Output is correct
49 Correct 6 ms 4984 KB Output is correct
50 Correct 6 ms 4984 KB Output is correct
51 Correct 6 ms 5112 KB Output is correct
52 Correct 7 ms 5112 KB Output is correct
53 Correct 7 ms 5112 KB Output is correct
54 Correct 43 ms 6004 KB Output is correct
55 Correct 15 ms 6012 KB Output is correct
56 Correct 96 ms 13788 KB Output is correct
57 Correct 85 ms 13404 KB Output is correct
58 Correct 94 ms 13660 KB Output is correct
59 Correct 95 ms 13528 KB Output is correct
60 Correct 96 ms 13396 KB Output is correct
61 Correct 84 ms 13404 KB Output is correct
62 Correct 96 ms 13532 KB Output is correct
63 Correct 96 ms 13680 KB Output is correct
64 Correct 95 ms 13532 KB Output is correct
65 Correct 96 ms 13400 KB Output is correct
66 Correct 95 ms 13404 KB Output is correct
67 Correct 94 ms 13532 KB Output is correct
68 Correct 97 ms 13540 KB Output is correct
69 Correct 6 ms 4984 KB Output is correct
70 Correct 6 ms 4984 KB Output is correct
71 Correct 97 ms 13404 KB Output is correct
72 Correct 96 ms 13544 KB Output is correct
73 Correct 96 ms 13660 KB Output is correct
74 Correct 6 ms 4984 KB Output is correct
75 Correct 6 ms 4984 KB Output is correct
76 Correct 7 ms 4984 KB Output is correct
77 Correct 7 ms 4984 KB Output is correct
78 Correct 149 ms 18524 KB Output is correct
79 Correct 141 ms 13788 KB Output is correct
80 Correct 147 ms 18400 KB Output is correct
81 Correct 100 ms 13276 KB Output is correct
82 Correct 146 ms 18460 KB Output is correct
83 Correct 141 ms 15384 KB Output is correct
84 Correct 6 ms 4984 KB Output is correct
85 Correct 6 ms 4984 KB Output is correct
86 Correct 6 ms 4984 KB Output is correct
87 Correct 6 ms 5112 KB Output is correct
88 Correct 7 ms 5240 KB Output is correct
89 Correct 7 ms 5112 KB Output is correct
90 Correct 7 ms 5112 KB Output is correct
91 Correct 7 ms 5084 KB Output is correct
92 Correct 7 ms 5112 KB Output is correct
93 Correct 9 ms 5112 KB Output is correct
94 Correct 7 ms 5112 KB Output is correct
95 Correct 7 ms 5112 KB Output is correct
96 Correct 7 ms 5112 KB Output is correct
97 Correct 7 ms 5112 KB Output is correct
98 Correct 7 ms 5112 KB Output is correct
99 Correct 7 ms 5112 KB Output is correct
100 Correct 7 ms 5112 KB Output is correct
101 Correct 19 ms 6388 KB Output is correct
102 Correct 18 ms 6008 KB Output is correct
103 Correct 188 ms 18376 KB Output is correct
104 Correct 165 ms 18524 KB Output is correct
105 Correct 158 ms 15836 KB Output is correct
106 Correct 151 ms 18392 KB Output is correct
107 Correct 126 ms 13768 KB Output is correct
108 Correct 121 ms 14172 KB Output is correct
109 Correct 98 ms 13536 KB Output is correct
110 Correct 96 ms 13532 KB Output is correct
111 Correct 149 ms 17868 KB Output is correct
112 Correct 175 ms 16988 KB Output is correct
113 Correct 145 ms 13756 KB Output is correct
114 Correct 152 ms 18524 KB Output is correct
115 Correct 149 ms 18508 KB Output is correct