oj.uz

답안 #267029

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
267029 2020-08-15T17:01:54 Z Dremix10 Arranging Shoes (IOI19_shoes) C++17
100 / 100
 268 ms 35448 KB 
#include "shoes.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair<int,int> pi;
typedef pair<ll,ll> pl;
#define F first
#define S second
#define endl '\n'
#define all(x) (x).begin(),(x).end()
#if dremix
    #define p(x) cerr<<#x<<" = "<<x<<endl;
    #define p2(x,y) cerr<<#x<<" , "<<#y<<" = "<<x<<" , "<<y<<endl;
    #define pp(x) cerr<<#x<<" = ("<<x.F<<" , "<<x.S<<")"<<endl;
    #define pv(x) cerr<<#x<<" = {";for(auto u : x)cerr<<u<<", ";cerr<<"}"<<endl;
    #define ppv(x) cerr<<#x<<" = {";for(auto u : x)cerr<<u.F<<"-"<<u.S<<", ";cerr<<"}"<<endl;
#else
    #define p(x)
    #define p2(x,y)
    #define pp(x)
    #define pv(x)
    #define ppv(x)
#endif
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
const int maxp = 22;
const ld EPS = 1e-18;
const ll INF = 1e18;
const int MOD = 1e9+7;
const int N = 2e5+1;


template<typename T>
struct SEGTREE{
    struct node{
        T val; // for adding more stuff

        node() : val(0) {}
        node(T _val) : val(_val) {}
    };
    vector<node> seg;
    int N;

    void init(int n){
        N = n;
        seg.assign(4*n,node());
    }

    node merge(node x, node y){
        node res;
        res.val = x.val + y.val;
        return res;
    }

    void build(int s, int e, int idx, T arr[]){
        if(s == e){
            seg[idx] = node(arr[s]);
            return;
        }
        int mid = (s+e)/2;
        build(s,mid,idx*2,arr);
        build(mid+1,e,idx*2+1,arr);
        seg[idx] = merge(seg[idx*2],seg[idx*2+1]);
    }

    // supports 1-indexing
    void build(T arr[]){
        build(1,N,1,arr);
    }

    void update(int s, int e, int idx, int k, T val){
        if(s==e && s==k){
            seg[idx].val += val;
            return;
        }
        if(s>k || e<k)
            return;
        int mid = (s+e)/2;
        update(s,mid,idx*2,k,val);
        update(mid+1,e,idx*2+1,k,val);
        seg[idx] = merge(seg[idx*2],seg[idx*2+1]);
    }

    // arr[k] += val
    void update(int k, T val){
        update(1,N,1,k,val);
    }

    node query(int s, int e, int idx, int qs, int qe){
        if(qs<=s && e<=qe)
            return seg[idx];
        if(s>qe || e<qs)
            return node();
        int mid = (s+e)/2;
        return merge(query(s,mid,idx*2,qs,qe),query(mid+1,e,idx*2+1,qs,qe));
    }

    T query(int l, int r){
        return query(1,N,1,l,r).val;
    }

};

long long count_swaps(vector<int> s) {
    int i,n = s.size();

    int arr[n+1];
    for(i=1;i<=n;i++)arr[i]=1;

    SEGTREE<int> seg;
    seg.init(n);
    seg.build(arr);

    vector<set<int> > l(n+1);
    vector<set<int> > r(n+1);

    ll ans = 0;

    for(i=0;i<n;i++){
        if(s[i]<0)l[-s[i]].insert(i+1);
        else r[s[i]].insert(i+1);
    }
    for(i=1;i<=n/2;i++){
        pv(l[i])
        pv(r[i])
    }

    for(i=0;i<n;i++){
        if(seg.query(i+1,i+1)==0)continue;
        for(int j=1;j<=n/2;j++){
            pv(l[j])
            pv(r[j])
        }
        if(s[i]<0){
            int nxt = *(r[-s[i]].begin());
            ans += seg.query(1,nxt) - 2;
            p2(nxt,ans)
            seg.update(i+1,-1);
            seg.update(nxt,-1);
            r[-s[i]].erase(nxt);
            l[-s[i]].erase(i+1);
        }
        else{
            int nxt = *(l[s[i]].begin());
            ans += seg.query(1,nxt) - 1;
            p2(nxt,ans)
            seg.update(i+1,-1);
            seg.update(nxt,-1);
            r[s[i]].erase(i+1);
            l[s[i]].erase(nxt);
        }
    }
    return ans;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 1 ms 256 KB Output is correct
13 Correct 0 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 2 ms 640 KB Output is correct
19 Correct 2 ms 640 KB Output is correct
20 Correct 16 ms 3840 KB Output is correct
21 Correct 16 ms 3840 KB Output is correct
22 Correct 178 ms 35320 KB Output is correct
23 Correct 190 ms 35192 KB Output is correct
24 Correct 180 ms 35448 KB Output is correct
25 Correct 190 ms 35064 KB Output is correct
26 Correct 182 ms 35320 KB Output is correct
27 Correct 192 ms 35064 KB Output is correct
28 Correct 185 ms 35324 KB Output is correct
29 Correct 185 ms 35320 KB Output is correct
30 Correct 188 ms 35192 KB Output is correct
31 Correct 182 ms 35320 KB Output is correct
32 Correct 186 ms 35320 KB Output is correct
33 Correct 187 ms 35068 KB Output is correct
34 Correct 189 ms 35220 KB Output is correct
35 Correct 1 ms 256 KB Output is correct
36 Correct 0 ms 256 KB Output is correct
37 Correct 193 ms 35192 KB Output is correct
38 Correct 184 ms 35196 KB Output is correct
39 Correct 192 ms 35320 KB Output is correct

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 176 ms 35192 KB Output is correct
6 Correct 268 ms 35192 KB Output is correct
7 Correct 199 ms 35192 KB Output is correct
8 Correct 195 ms 35192 KB Output is correct
9 Correct 185 ms 35192 KB Output is correct
10 Correct 197 ms 35192 KB Output is correct

Subtask #5
20.0 / 20.0

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

Subtask #6
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Correct 0 ms 256 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 1 ms 256 KB Output is correct
13 Correct 0 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 0 ms 256 KB Output is correct
17 Correct 0 ms 256 KB Output is correct
18 Correct 0 ms 256 KB Output is correct
19 Correct 1 ms 256 KB Output is correct
20 Correct 0 ms 256 KB Output is correct
21 Correct 1 ms 256 KB Output is correct
22 Correct 0 ms 256 KB Output is correct
23 Correct 0 ms 256 KB Output is correct
24 Correct 0 ms 256 KB Output is correct
25 Correct 0 ms 256 KB Output is correct
26 Correct 1 ms 256 KB Output is correct
27 Correct 0 ms 256 KB Output is correct
28 Correct 1 ms 256 KB Output is correct
29 Correct 0 ms 256 KB Output is correct
30 Correct 1 ms 256 KB Output is correct
31 Correct 0 ms 256 KB Output is correct
32 Correct 1 ms 256 KB Output is correct
33 Correct 0 ms 256 KB Output is correct
34 Correct 1 ms 256 KB Output is correct
35 Correct 1 ms 256 KB Output is correct
36 Correct 1 ms 384 KB Output is correct
37 Correct 0 ms 256 KB Output is correct
38 Correct 1 ms 384 KB Output is correct
39 Correct 1 ms 256 KB Output is correct
40 Correct 0 ms 256 KB Output is correct
41 Correct 1 ms 256 KB Output is correct
42 Correct 0 ms 256 KB Output is correct
43 Correct 0 ms 256 KB Output is correct
44 Correct 0 ms 256 KB Output is correct
45 Correct 0 ms 256 KB Output is correct
46 Correct 1 ms 256 KB Output is correct
47 Correct 0 ms 256 KB Output is correct
48 Correct 0 ms 256 KB Output is correct
49 Correct 1 ms 384 KB Output is correct
50 Correct 1 ms 384 KB Output is correct
51 Correct 1 ms 384 KB Output is correct
52 Correct 2 ms 640 KB Output is correct
53 Correct 2 ms 640 KB Output is correct
54 Correct 16 ms 3840 KB Output is correct
55 Correct 16 ms 3840 KB Output is correct
56 Correct 178 ms 35320 KB Output is correct
57 Correct 190 ms 35192 KB Output is correct
58 Correct 180 ms 35448 KB Output is correct
59 Correct 190 ms 35064 KB Output is correct
60 Correct 182 ms 35320 KB Output is correct
61 Correct 192 ms 35064 KB Output is correct
62 Correct 185 ms 35324 KB Output is correct
63 Correct 185 ms 35320 KB Output is correct
64 Correct 188 ms 35192 KB Output is correct
65 Correct 182 ms 35320 KB Output is correct
66 Correct 186 ms 35320 KB Output is correct
67 Correct 187 ms 35068 KB Output is correct
68 Correct 189 ms 35220 KB Output is correct
69 Correct 1 ms 256 KB Output is correct
70 Correct 0 ms 256 KB Output is correct
71 Correct 193 ms 35192 KB Output is correct
72 Correct 184 ms 35196 KB Output is correct
73 Correct 192 ms 35320 KB Output is correct
74 Correct 1 ms 384 KB Output is correct
75 Correct 1 ms 256 KB Output is correct
76 Correct 0 ms 256 KB Output is correct
77 Correct 0 ms 256 KB Output is correct
78 Correct 176 ms 35192 KB Output is correct
79 Correct 268 ms 35192 KB Output is correct
80 Correct 199 ms 35192 KB Output is correct
81 Correct 195 ms 35192 KB Output is correct
82 Correct 185 ms 35192 KB Output is correct
83 Correct 197 ms 35192 KB Output is correct
84 Correct 0 ms 256 KB Output is correct
85 Correct 1 ms 256 KB Output is correct
86 Correct 1 ms 384 KB Output is correct
87 Correct 1 ms 384 KB Output is correct
88 Correct 2 ms 640 KB Output is correct
89 Correct 2 ms 640 KB Output is correct
90 Correct 3 ms 640 KB Output is correct
91 Correct 2 ms 640 KB Output is correct
92 Correct 2 ms 640 KB Output is correct
93 Correct 2 ms 640 KB Output is correct
94 Correct 2 ms 640 KB Output is correct
95 Correct 2 ms 640 KB Output is correct
96 Correct 2 ms 640 KB Output is correct
97 Correct 3 ms 640 KB Output is correct
98 Correct 2 ms 640 KB Output is correct
99 Correct 2 ms 768 KB Output is correct
100 Correct 2 ms 640 KB Output is correct
101 Correct 16 ms 3840 KB Output is correct
102 Correct 18 ms 3840 KB Output is correct
103 Correct 235 ms 35320 KB Output is correct
104 Correct 185 ms 35192 KB Output is correct
105 Correct 224 ms 35320 KB Output is correct
106 Correct 209 ms 35192 KB Output is correct
107 Correct 232 ms 35192 KB Output is correct
108 Correct 249 ms 35192 KB Output is correct
109 Correct 177 ms 35320 KB Output is correct
110 Correct 184 ms 35320 KB Output is correct
111 Correct 177 ms 35192 KB Output is correct
112 Correct 236 ms 35196 KB Output is correct
113 Correct 257 ms 35192 KB Output is correct
114 Correct 198 ms 35320 KB Output is correct
115 Correct 201 ms 35196 KB Output is correct