oj.uz

답안 #219601

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
219601 2020-04-05T16:52:33 Z thebes Rope (JOI17_rope) C++14
100 / 100
 2397 ms 203512 KB 
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,ssse3,sse3,sse4,popcnt,avx,mmx,abm,tune=native")
#include <bits/stdc++.h>
#define DEBUG 1
using namespace std;

namespace output{
    void __(short x){cout<<x;}
    void __(unsigned x){cout<<x;}
    void __(int x){cout<<x;}
    void __(long long x){cout<<x;}
    void __(unsigned long long x){cout<<x;}
    void __(double x){cout<<x;}
    void __(long double x){cout<<x;}
    void __(char x){cout<<x;}
    void __(const char*x){cout<<x;}
    void __(const string&x){cout<<x;}
    void __(bool x){cout<<(x?"true":"false");}
    template<class S,class T>
    void __(const pair<S,T>&x){__(DEBUG?"(":""),__(x.first),__(DEBUG?", ":" "),__(x.second),__(DEBUG?")":"");}
    template<class T>
    void __(const vector<T>&x){__(DEBUG?"{":"");bool _=0;for(const auto&v:x)__(_?DEBUG?", ":" ":""),__(v),_=1;__(DEBUG?"}":"");}
    template<class T>
    void __(const set<T>&x){__(DEBUG?"{":"");bool _=0;for(const auto&v:x)__(_?DEBUG?", ":" ":""),__(v),_=1;__(DEBUG?"}":"");}
    template<class T>
    void __(const multiset<T>&x){__(DEBUG?"{":"");bool _=0;for(const auto&v:x)__(_?DEBUG?", ":" ":""),__(v),_=1;__(DEBUG?"}":"");}
    template<class S,class T>
    void __(const map<S,T>&x){__(DEBUG?"{":"");bool _=0;for(const auto&v:x)__(_?DEBUG?", ":" ":""),__(v),_=1;__(DEBUG?"}":"");}
    void pr(){cout<<"\n";}
    template<class S,class... T>
    void pr(const S&a,const T&...b){__(a);if(sizeof...(b))__(' ');pr(b...);}
}

using namespace output;

typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<int,char> pic;
typedef pair<double,double> pdd;
typedef pair<ld,ld> pld;
typedef vector<int> vi;
typedef vector<ll> vl;

#define pb push_back
#define fox(i,x,y) for(int i=(x);i<=(y);i++)
#define foxr(i,x,y) for(int i=(y);i>=(x);i--)

const int MN = 1e6+6;
int T, N, M, i, j, mx, arr[MN], cnt[MN], bit[2*MN];
map<int,int> adj[MN][2];
inline void upd(int p,int v){for(;p<=T;p+=p&-p)bit[p]+=v;}
inline int qu(){
    int cur=0;
    for(int i=mx;i>=0;i--){
        if(!bit[cur+(1<<i)]) cur+=(1<<i);
    }
    return cur+1;
}

int main(){
    for(scanf("%d%d",&N,&M),i=1;i<=N;i++){
        scanf("%d",&arr[i]);
        cnt[arr[i]]++;
    }
    for(mx=0;(1<<(mx+1))<N;mx++){}
    T=(1<<(++mx));
    for(i=1;i+1<=N;i+=2){
        if(arr[i]!=arr[i+1]){
            adj[arr[i]][0][arr[i+1]]++;
            adj[arr[i+1]][0][arr[i]]++;
        }
    }
    for(i=2;i+1<=N;i+=2){
        if(arr[i]!=arr[i+1]){
            adj[arr[i]][1][arr[i+1]]++;
            adj[arr[i+1]][1][arr[i]]++;
        }
    }
    if(M==1){
        printf("0\n");
        return 0;
    }
    for(i=1;i<=M;i++){
        upd(N-cnt[i],1);
    }
    for(i=1;i<=M;i++){
        int ans = N;
        for(j=0;j<2;j++){
            upd(N-cnt[i],-1);
            for(auto v : adj[i][j]){
                upd(N-cnt[v.first],-1);
                upd(N-cnt[v.first]+v.second,1);
            }
            ans = min(ans,qu()-cnt[i]);
            for(auto v : adj[i][j]){
                upd(N-cnt[v.first]+v.second,-1);
                upd(N-cnt[v.first],1);
            }
            upd(N-cnt[i],1);
        }
        printf("%d\n",ans);
    }
    return 0;
}

Compilation message

rope.cpp: In function 'int main()':
rope.cpp:64:28: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for(scanf("%d%d",&N,&M),i=1;i<=N;i++){
         ~~~~~~~~~~~~~~~~~~~^~~~
rope.cpp:65:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d",&arr[i]);
         ~~~~~^~~~~~~~~~~~~~

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 58 ms 94200 KB Output is correct
2 Correct 59 ms 94204 KB Output is correct
3 Correct 60 ms 94200 KB Output is correct
4 Correct 60 ms 94328 KB Output is correct
5 Correct 59 ms 94200 KB Output is correct
6 Correct 59 ms 94200 KB Output is correct
7 Correct 59 ms 94200 KB Output is correct
8 Correct 58 ms 94200 KB Output is correct
9 Correct 67 ms 94584 KB Output is correct
10 Correct 65 ms 94328 KB Output is correct
11 Correct 61 ms 94328 KB Output is correct
12 Correct 59 ms 94200 KB Output is correct
13 Correct 58 ms 94208 KB Output is correct
14 Correct 58 ms 94328 KB Output is correct
15 Correct 61 ms 94456 KB Output is correct
16 Correct 58 ms 94200 KB Output is correct
17 Correct 60 ms 94200 KB Output is correct
18 Correct 58 ms 94200 KB Output is correct
19 Correct 58 ms 94200 KB Output is correct
20 Correct 59 ms 94200 KB Output is correct
21 Correct 65 ms 94328 KB Output is correct
22 Correct 67 ms 94340 KB Output is correct
23 Correct 58 ms 94328 KB Output is correct
24 Correct 58 ms 94328 KB Output is correct
25 Correct 57 ms 94328 KB Output is correct
26 Correct 57 ms 94328 KB Output is correct

Subtask #2
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 58 ms 94200 KB Output is correct
2 Correct 59 ms 94204 KB Output is correct
3 Correct 60 ms 94200 KB Output is correct
4 Correct 60 ms 94328 KB Output is correct
5 Correct 59 ms 94200 KB Output is correct
6 Correct 59 ms 94200 KB Output is correct
7 Correct 59 ms 94200 KB Output is correct
8 Correct 58 ms 94200 KB Output is correct
9 Correct 67 ms 94584 KB Output is correct
10 Correct 65 ms 94328 KB Output is correct
11 Correct 61 ms 94328 KB Output is correct
12 Correct 59 ms 94200 KB Output is correct
13 Correct 58 ms 94208 KB Output is correct
14 Correct 58 ms 94328 KB Output is correct
15 Correct 61 ms 94456 KB Output is correct
16 Correct 58 ms 94200 KB Output is correct
17 Correct 60 ms 94200 KB Output is correct
18 Correct 58 ms 94200 KB Output is correct
19 Correct 58 ms 94200 KB Output is correct
20 Correct 59 ms 94200 KB Output is correct
21 Correct 65 ms 94328 KB Output is correct
22 Correct 67 ms 94340 KB Output is correct
23 Correct 58 ms 94328 KB Output is correct
24 Correct 58 ms 94328 KB Output is correct
25 Correct 57 ms 94328 KB Output is correct
26 Correct 57 ms 94328 KB Output is correct
27 Correct 71 ms 94944 KB Output is correct
28 Correct 69 ms 94840 KB Output is correct
29 Correct 74 ms 94840 KB Output is correct
30 Correct 71 ms 94840 KB Output is correct
31 Correct 73 ms 94840 KB Output is correct
32 Correct 71 ms 94968 KB Output is correct
33 Correct 70 ms 94972 KB Output is correct
34 Correct 71 ms 94968 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 58 ms 94200 KB Output is correct
2 Correct 59 ms 94204 KB Output is correct
3 Correct 60 ms 94200 KB Output is correct
4 Correct 60 ms 94328 KB Output is correct
5 Correct 59 ms 94200 KB Output is correct
6 Correct 59 ms 94200 KB Output is correct
7 Correct 59 ms 94200 KB Output is correct
8 Correct 58 ms 94200 KB Output is correct
9 Correct 67 ms 94584 KB Output is correct
10 Correct 65 ms 94328 KB Output is correct
11 Correct 61 ms 94328 KB Output is correct
12 Correct 59 ms 94200 KB Output is correct
13 Correct 58 ms 94208 KB Output is correct
14 Correct 58 ms 94328 KB Output is correct
15 Correct 61 ms 94456 KB Output is correct
16 Correct 58 ms 94200 KB Output is correct
17 Correct 60 ms 94200 KB Output is correct
18 Correct 58 ms 94200 KB Output is correct
19 Correct 58 ms 94200 KB Output is correct
20 Correct 59 ms 94200 KB Output is correct
21 Correct 65 ms 94328 KB Output is correct
22 Correct 67 ms 94340 KB Output is correct
23 Correct 58 ms 94328 KB Output is correct
24 Correct 58 ms 94328 KB Output is correct
25 Correct 57 ms 94328 KB Output is correct
26 Correct 57 ms 94328 KB Output is correct
27 Correct 71 ms 94944 KB Output is correct
28 Correct 69 ms 94840 KB Output is correct
29 Correct 74 ms 94840 KB Output is correct
30 Correct 71 ms 94840 KB Output is correct
31 Correct 73 ms 94840 KB Output is correct
32 Correct 71 ms 94968 KB Output is correct
33 Correct 70 ms 94972 KB Output is correct
34 Correct 71 ms 94968 KB Output is correct
35 Correct 151 ms 102776 KB Output is correct
36 Correct 150 ms 102776 KB Output is correct
37 Correct 153 ms 102780 KB Output is correct
38 Correct 155 ms 102648 KB Output is correct
39 Correct 149 ms 102776 KB Output is correct
40 Correct 105 ms 99064 KB Output is correct
41 Correct 109 ms 99148 KB Output is correct
42 Correct 99 ms 98168 KB Output is correct
43 Correct 99 ms 98040 KB Output is correct
44 Correct 105 ms 99192 KB Output is correct
45 Correct 105 ms 99192 KB Output is correct
46 Correct 99 ms 98296 KB Output is correct
47 Correct 99 ms 98144 KB Output is correct

Subtask #4
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 58 ms 94200 KB Output is correct
2 Correct 59 ms 94204 KB Output is correct
3 Correct 60 ms 94200 KB Output is correct
4 Correct 60 ms 94328 KB Output is correct
5 Correct 59 ms 94200 KB Output is correct
6 Correct 59 ms 94200 KB Output is correct
7 Correct 59 ms 94200 KB Output is correct
8 Correct 58 ms 94200 KB Output is correct
9 Correct 67 ms 94584 KB Output is correct
10 Correct 65 ms 94328 KB Output is correct
11 Correct 61 ms 94328 KB Output is correct
12 Correct 59 ms 94200 KB Output is correct
13 Correct 58 ms 94208 KB Output is correct
14 Correct 58 ms 94328 KB Output is correct
15 Correct 61 ms 94456 KB Output is correct
16 Correct 58 ms 94200 KB Output is correct
17 Correct 60 ms 94200 KB Output is correct
18 Correct 58 ms 94200 KB Output is correct
19 Correct 58 ms 94200 KB Output is correct
20 Correct 59 ms 94200 KB Output is correct
21 Correct 65 ms 94328 KB Output is correct
22 Correct 67 ms 94340 KB Output is correct
23 Correct 58 ms 94328 KB Output is correct
24 Correct 58 ms 94328 KB Output is correct
25 Correct 57 ms 94328 KB Output is correct
26 Correct 57 ms 94328 KB Output is correct
27 Correct 71 ms 94944 KB Output is correct
28 Correct 69 ms 94840 KB Output is correct
29 Correct 74 ms 94840 KB Output is correct
30 Correct 71 ms 94840 KB Output is correct
31 Correct 73 ms 94840 KB Output is correct
32 Correct 71 ms 94968 KB Output is correct
33 Correct 70 ms 94972 KB Output is correct
34 Correct 71 ms 94968 KB Output is correct
35 Correct 151 ms 102776 KB Output is correct
36 Correct 150 ms 102776 KB Output is correct
37 Correct 153 ms 102780 KB Output is correct
38 Correct 155 ms 102648 KB Output is correct
39 Correct 149 ms 102776 KB Output is correct
40 Correct 105 ms 99064 KB Output is correct
41 Correct 109 ms 99148 KB Output is correct
42 Correct 99 ms 98168 KB Output is correct
43 Correct 99 ms 98040 KB Output is correct
44 Correct 105 ms 99192 KB Output is correct
45 Correct 105 ms 99192 KB Output is correct
46 Correct 99 ms 98296 KB Output is correct
47 Correct 99 ms 98144 KB Output is correct
48 Correct 2397 ms 188024 KB Output is correct
49 Correct 2321 ms 187768 KB Output is correct
50 Correct 2320 ms 187768 KB Output is correct
51 Correct 2106 ms 174716 KB Output is correct
52 Correct 1801 ms 158072 KB Output is correct
53 Correct 948 ms 146304 KB Output is correct
54 Correct 680 ms 133496 KB Output is correct
55 Correct 669 ms 132712 KB Output is correct
56 Correct 602 ms 127228 KB Output is correct

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 58 ms 94200 KB Output is correct
2 Correct 59 ms 94204 KB Output is correct
3 Correct 60 ms 94200 KB Output is correct
4 Correct 60 ms 94328 KB Output is correct
5 Correct 59 ms 94200 KB Output is correct
6 Correct 59 ms 94200 KB Output is correct
7 Correct 59 ms 94200 KB Output is correct
8 Correct 58 ms 94200 KB Output is correct
9 Correct 67 ms 94584 KB Output is correct
10 Correct 65 ms 94328 KB Output is correct
11 Correct 61 ms 94328 KB Output is correct
12 Correct 59 ms 94200 KB Output is correct
13 Correct 58 ms 94208 KB Output is correct
14 Correct 58 ms 94328 KB Output is correct
15 Correct 61 ms 94456 KB Output is correct
16 Correct 58 ms 94200 KB Output is correct
17 Correct 60 ms 94200 KB Output is correct
18 Correct 58 ms 94200 KB Output is correct
19 Correct 58 ms 94200 KB Output is correct
20 Correct 59 ms 94200 KB Output is correct
21 Correct 65 ms 94328 KB Output is correct
22 Correct 67 ms 94340 KB Output is correct
23 Correct 58 ms 94328 KB Output is correct
24 Correct 58 ms 94328 KB Output is correct
25 Correct 57 ms 94328 KB Output is correct
26 Correct 57 ms 94328 KB Output is correct
27 Correct 71 ms 94944 KB Output is correct
28 Correct 69 ms 94840 KB Output is correct
29 Correct 74 ms 94840 KB Output is correct
30 Correct 71 ms 94840 KB Output is correct
31 Correct 73 ms 94840 KB Output is correct
32 Correct 71 ms 94968 KB Output is correct
33 Correct 70 ms 94972 KB Output is correct
34 Correct 71 ms 94968 KB Output is correct
35 Correct 151 ms 102776 KB Output is correct
36 Correct 150 ms 102776 KB Output is correct
37 Correct 153 ms 102780 KB Output is correct
38 Correct 155 ms 102648 KB Output is correct
39 Correct 149 ms 102776 KB Output is correct
40 Correct 105 ms 99064 KB Output is correct
41 Correct 109 ms 99148 KB Output is correct
42 Correct 99 ms 98168 KB Output is correct
43 Correct 99 ms 98040 KB Output is correct
44 Correct 105 ms 99192 KB Output is correct
45 Correct 105 ms 99192 KB Output is correct
46 Correct 99 ms 98296 KB Output is correct
47 Correct 99 ms 98144 KB Output is correct
48 Correct 2397 ms 188024 KB Output is correct
49 Correct 2321 ms 187768 KB Output is correct
50 Correct 2320 ms 187768 KB Output is correct
51 Correct 2106 ms 174716 KB Output is correct
52 Correct 1801 ms 158072 KB Output is correct
53 Correct 948 ms 146304 KB Output is correct
54 Correct 680 ms 133496 KB Output is correct
55 Correct 669 ms 132712 KB Output is correct
56 Correct 602 ms 127228 KB Output is correct
57 Correct 1764 ms 203512 KB Output is correct
58 Correct 1771 ms 199416 KB Output is correct
59 Correct 1758 ms 199032 KB Output is correct
60 Correct 1758 ms 200056 KB Output is correct
61 Correct 1823 ms 200184 KB Output is correct
62 Correct 1002 ms 150136 KB Output is correct
63 Correct 1269 ms 168808 KB Output is correct
64 Correct 1106 ms 159508 KB Output is correct
65 Correct 827 ms 136444 KB Output is correct