oj.uz

Submission #219600

# Submission time Handle Problem Language Result Execution time Memory
219600 2020-04-05T16:51:56 Z thebes Rope (JOI17_rope) C++14
0 / 100
 2500 ms 94420 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]]++;
        }
    }
    for(i=1;i<=M;i++){
        upd(N-cnt[i],1);
    }
    if(M==1){
        printf("0\n");
        return 0;
    }
    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
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 58 ms 94200 KB Output is correct
2 Correct 59 ms 94324 KB Output is correct
3 Correct 58 ms 94328 KB Output is correct
4 Correct 59 ms 94328 KB Output is correct
5 Correct 57 ms 94328 KB Output is correct
6 Correct 61 ms 94420 KB Output is correct
7 Correct 61 ms 94328 KB Output is correct
8 Correct 61 ms 94328 KB Output is correct
9 Correct 60 ms 94200 KB Output is correct
10 Correct 59 ms 94328 KB Output is correct
11 Correct 57 ms 94328 KB Output is correct
12 Correct 59 ms 94328 KB Output is correct
13 Correct 58 ms 94200 KB Output is correct
14 Correct 57 ms 94328 KB Output is correct
15 Correct 58 ms 94328 KB Output is correct
16 Correct 57 ms 94328 KB Output is correct
17 Correct 59 ms 94204 KB Output is correct
18 Correct 58 ms 94200 KB Output is correct
19 Correct 61 ms 94332 KB Output is correct
20 Correct 60 ms 94328 KB Output is correct
21 Correct 58 ms 94328 KB Output is correct
22 Execution timed out 2590 ms 94328 KB Time limit exceeded
23 Halted 0 ms 0 KB -

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 58 ms 94200 KB Output is correct
2 Correct 59 ms 94324 KB Output is correct
3 Correct 58 ms 94328 KB Output is correct
4 Correct 59 ms 94328 KB Output is correct
5 Correct 57 ms 94328 KB Output is correct
6 Correct 61 ms 94420 KB Output is correct
7 Correct 61 ms 94328 KB Output is correct
8 Correct 61 ms 94328 KB Output is correct
9 Correct 60 ms 94200 KB Output is correct
10 Correct 59 ms 94328 KB Output is correct
11 Correct 57 ms 94328 KB Output is correct
12 Correct 59 ms 94328 KB Output is correct
13 Correct 58 ms 94200 KB Output is correct
14 Correct 57 ms 94328 KB Output is correct
15 Correct 58 ms 94328 KB Output is correct
16 Correct 57 ms 94328 KB Output is correct
17 Correct 59 ms 94204 KB Output is correct
18 Correct 58 ms 94200 KB Output is correct
19 Correct 61 ms 94332 KB Output is correct
20 Correct 60 ms 94328 KB Output is correct
21 Correct 58 ms 94328 KB Output is correct
22 Execution timed out 2590 ms 94328 KB Time limit exceeded
23 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 58 ms 94200 KB Output is correct
2 Correct 59 ms 94324 KB Output is correct
3 Correct 58 ms 94328 KB Output is correct
4 Correct 59 ms 94328 KB Output is correct
5 Correct 57 ms 94328 KB Output is correct
6 Correct 61 ms 94420 KB Output is correct
7 Correct 61 ms 94328 KB Output is correct
8 Correct 61 ms 94328 KB Output is correct
9 Correct 60 ms 94200 KB Output is correct
10 Correct 59 ms 94328 KB Output is correct
11 Correct 57 ms 94328 KB Output is correct
12 Correct 59 ms 94328 KB Output is correct
13 Correct 58 ms 94200 KB Output is correct
14 Correct 57 ms 94328 KB Output is correct
15 Correct 58 ms 94328 KB Output is correct
16 Correct 57 ms 94328 KB Output is correct
17 Correct 59 ms 94204 KB Output is correct
18 Correct 58 ms 94200 KB Output is correct
19 Correct 61 ms 94332 KB Output is correct
20 Correct 60 ms 94328 KB Output is correct
21 Correct 58 ms 94328 KB Output is correct
22 Execution timed out 2590 ms 94328 KB Time limit exceeded
23 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 58 ms 94200 KB Output is correct
2 Correct 59 ms 94324 KB Output is correct
3 Correct 58 ms 94328 KB Output is correct
4 Correct 59 ms 94328 KB Output is correct
5 Correct 57 ms 94328 KB Output is correct
6 Correct 61 ms 94420 KB Output is correct
7 Correct 61 ms 94328 KB Output is correct
8 Correct 61 ms 94328 KB Output is correct
9 Correct 60 ms 94200 KB Output is correct
10 Correct 59 ms 94328 KB Output is correct
11 Correct 57 ms 94328 KB Output is correct
12 Correct 59 ms 94328 KB Output is correct
13 Correct 58 ms 94200 KB Output is correct
14 Correct 57 ms 94328 KB Output is correct
15 Correct 58 ms 94328 KB Output is correct
16 Correct 57 ms 94328 KB Output is correct
17 Correct 59 ms 94204 KB Output is correct
18 Correct 58 ms 94200 KB Output is correct
19 Correct 61 ms 94332 KB Output is correct
20 Correct 60 ms 94328 KB Output is correct
21 Correct 58 ms 94328 KB Output is correct
22 Execution timed out 2590 ms 94328 KB Time limit exceeded
23 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 58 ms 94200 KB Output is correct
2 Correct 59 ms 94324 KB Output is correct
3 Correct 58 ms 94328 KB Output is correct
4 Correct 59 ms 94328 KB Output is correct
5 Correct 57 ms 94328 KB Output is correct
6 Correct 61 ms 94420 KB Output is correct
7 Correct 61 ms 94328 KB Output is correct
8 Correct 61 ms 94328 KB Output is correct
9 Correct 60 ms 94200 KB Output is correct
10 Correct 59 ms 94328 KB Output is correct
11 Correct 57 ms 94328 KB Output is correct
12 Correct 59 ms 94328 KB Output is correct
13 Correct 58 ms 94200 KB Output is correct
14 Correct 57 ms 94328 KB Output is correct
15 Correct 58 ms 94328 KB Output is correct
16 Correct 57 ms 94328 KB Output is correct
17 Correct 59 ms 94204 KB Output is correct
18 Correct 58 ms 94200 KB Output is correct
19 Correct 61 ms 94332 KB Output is correct
20 Correct 60 ms 94328 KB Output is correct
21 Correct 58 ms 94328 KB Output is correct
22 Execution timed out 2590 ms 94328 KB Time limit exceeded
23 Halted 0 ms 0 KB -