oj.uz

답안 #219591

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
219591 2020-04-05T16:29:24 Z thebes Rope (JOI17_rope) C++14
55 / 100
 2500 ms 191864 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 N, M, i, j, arr[MN], cnt[MN];
map<int,int> adj[MN][2]; multiset<int> mp;

int main(){
    for(scanf("%d%d",&N,&M),i=1;i<=N;i++){
        scanf("%d",&arr[i]);
        cnt[arr[i]]++;
    }
    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++){
        mp.insert(N-cnt[i]);
    }
    if(M==1){
        printf("0\n");
        return 0;
    }
    for(i=1;i<=M;i++){
        int ans = N;
        for(j=0;j<2;j++){
            mp.erase(mp.find(N-cnt[i]));
            for(auto v : adj[i][j]){
                mp.erase(mp.find(N-cnt[v.first]));
                mp.insert(N-cnt[v.first]+v.second);
            }
            auto it = mp.begin();
            ans = min(ans,*it-cnt[i]);
            for(auto v : adj[i][j]){
                mp.erase(mp.find(N-cnt[v.first]+v.second));
                mp.insert(N-cnt[v.first]);
            }
            mp.insert(N-cnt[i]);
        }
        printf("%d\n",ans);
    }
    return 0;
}

Compilation message

rope.cpp: In function 'int main()':
rope.cpp:56: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:57: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 60 ms 94200 KB Output is correct
2 Correct 60 ms 94200 KB Output is correct
3 Correct 57 ms 94200 KB Output is correct
4 Correct 58 ms 94312 KB Output is correct
5 Correct 58 ms 94200 KB Output is correct
6 Correct 58 ms 94200 KB Output is correct
7 Correct 59 ms 94200 KB Output is correct
8 Correct 59 ms 94200 KB Output is correct
9 Correct 62 ms 94200 KB Output is correct
10 Correct 57 ms 94296 KB Output is correct
11 Correct 58 ms 94200 KB Output is correct
12 Correct 57 ms 94200 KB Output is correct
13 Correct 58 ms 94200 KB Output is correct
14 Correct 61 ms 94328 KB Output is correct
15 Correct 57 ms 94200 KB Output is correct
16 Correct 58 ms 94200 KB Output is correct
17 Correct 59 ms 94204 KB Output is correct
18 Correct 59 ms 94200 KB Output is correct
19 Correct 58 ms 94200 KB Output is correct
20 Correct 60 ms 94328 KB Output is correct
21 Correct 58 ms 94200 KB Output is correct
22 Correct 58 ms 94200 KB Output is correct
23 Correct 57 ms 94200 KB Output is correct
24 Correct 59 ms 94200 KB Output is correct
25 Correct 57 ms 94200 KB Output is correct
26 Correct 59 ms 94200 KB Output is correct

Subtask #2
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 60 ms 94200 KB Output is correct
2 Correct 60 ms 94200 KB Output is correct
3 Correct 57 ms 94200 KB Output is correct
4 Correct 58 ms 94312 KB Output is correct
5 Correct 58 ms 94200 KB Output is correct
6 Correct 58 ms 94200 KB Output is correct
7 Correct 59 ms 94200 KB Output is correct
8 Correct 59 ms 94200 KB Output is correct
9 Correct 62 ms 94200 KB Output is correct
10 Correct 57 ms 94296 KB Output is correct
11 Correct 58 ms 94200 KB Output is correct
12 Correct 57 ms 94200 KB Output is correct
13 Correct 58 ms 94200 KB Output is correct
14 Correct 61 ms 94328 KB Output is correct
15 Correct 57 ms 94200 KB Output is correct
16 Correct 58 ms 94200 KB Output is correct
17 Correct 59 ms 94204 KB Output is correct
18 Correct 59 ms 94200 KB Output is correct
19 Correct 58 ms 94200 KB Output is correct
20 Correct 60 ms 94328 KB Output is correct
21 Correct 58 ms 94200 KB Output is correct
22 Correct 58 ms 94200 KB Output is correct
23 Correct 57 ms 94200 KB Output is correct
24 Correct 59 ms 94200 KB Output is correct
25 Correct 57 ms 94200 KB Output is correct
26 Correct 59 ms 94200 KB Output is correct
27 Correct 75 ms 94844 KB Output is correct
28 Correct 72 ms 94840 KB Output is correct
29 Correct 83 ms 94840 KB Output is correct
30 Correct 73 ms 94840 KB Output is correct
31 Correct 76 ms 94844 KB Output is correct
32 Correct 72 ms 94840 KB Output is correct
33 Correct 76 ms 94900 KB Output is correct
34 Correct 74 ms 94840 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 60 ms 94200 KB Output is correct
2 Correct 60 ms 94200 KB Output is correct
3 Correct 57 ms 94200 KB Output is correct
4 Correct 58 ms 94312 KB Output is correct
5 Correct 58 ms 94200 KB Output is correct
6 Correct 58 ms 94200 KB Output is correct
7 Correct 59 ms 94200 KB Output is correct
8 Correct 59 ms 94200 KB Output is correct
9 Correct 62 ms 94200 KB Output is correct
10 Correct 57 ms 94296 KB Output is correct
11 Correct 58 ms 94200 KB Output is correct
12 Correct 57 ms 94200 KB Output is correct
13 Correct 58 ms 94200 KB Output is correct
14 Correct 61 ms 94328 KB Output is correct
15 Correct 57 ms 94200 KB Output is correct
16 Correct 58 ms 94200 KB Output is correct
17 Correct 59 ms 94204 KB Output is correct
18 Correct 59 ms 94200 KB Output is correct
19 Correct 58 ms 94200 KB Output is correct
20 Correct 60 ms 94328 KB Output is correct
21 Correct 58 ms 94200 KB Output is correct
22 Correct 58 ms 94200 KB Output is correct
23 Correct 57 ms 94200 KB Output is correct
24 Correct 59 ms 94200 KB Output is correct
25 Correct 57 ms 94200 KB Output is correct
26 Correct 59 ms 94200 KB Output is correct
27 Correct 75 ms 94844 KB Output is correct
28 Correct 72 ms 94840 KB Output is correct
29 Correct 83 ms 94840 KB Output is correct
30 Correct 73 ms 94840 KB Output is correct
31 Correct 76 ms 94844 KB Output is correct
32 Correct 72 ms 94840 KB Output is correct
33 Correct 76 ms 94900 KB Output is correct
34 Correct 74 ms 94840 KB Output is correct
35 Correct 205 ms 102780 KB Output is correct
36 Correct 215 ms 102864 KB Output is correct
37 Correct 211 ms 102648 KB Output is correct
38 Correct 200 ms 102648 KB Output is correct
39 Correct 208 ms 102804 KB Output is correct
40 Correct 132 ms 99192 KB Output is correct
41 Correct 150 ms 99044 KB Output is correct
42 Correct 117 ms 98168 KB Output is correct
43 Correct 122 ms 98144 KB Output is correct
44 Correct 133 ms 99192 KB Output is correct
45 Correct 131 ms 99192 KB Output is correct
46 Correct 125 ms 98296 KB Output is correct
47 Correct 128 ms 98296 KB Output is correct

Subtask #4
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 60 ms 94200 KB Output is correct
2 Correct 60 ms 94200 KB Output is correct
3 Correct 57 ms 94200 KB Output is correct
4 Correct 58 ms 94312 KB Output is correct
5 Correct 58 ms 94200 KB Output is correct
6 Correct 58 ms 94200 KB Output is correct
7 Correct 59 ms 94200 KB Output is correct
8 Correct 59 ms 94200 KB Output is correct
9 Correct 62 ms 94200 KB Output is correct
10 Correct 57 ms 94296 KB Output is correct
11 Correct 58 ms 94200 KB Output is correct
12 Correct 57 ms 94200 KB Output is correct
13 Correct 58 ms 94200 KB Output is correct
14 Correct 61 ms 94328 KB Output is correct
15 Correct 57 ms 94200 KB Output is correct
16 Correct 58 ms 94200 KB Output is correct
17 Correct 59 ms 94204 KB Output is correct
18 Correct 59 ms 94200 KB Output is correct
19 Correct 58 ms 94200 KB Output is correct
20 Correct 60 ms 94328 KB Output is correct
21 Correct 58 ms 94200 KB Output is correct
22 Correct 58 ms 94200 KB Output is correct
23 Correct 57 ms 94200 KB Output is correct
24 Correct 59 ms 94200 KB Output is correct
25 Correct 57 ms 94200 KB Output is correct
26 Correct 59 ms 94200 KB Output is correct
27 Correct 75 ms 94844 KB Output is correct
28 Correct 72 ms 94840 KB Output is correct
29 Correct 83 ms 94840 KB Output is correct
30 Correct 73 ms 94840 KB Output is correct
31 Correct 76 ms 94844 KB Output is correct
32 Correct 72 ms 94840 KB Output is correct
33 Correct 76 ms 94900 KB Output is correct
34 Correct 74 ms 94840 KB Output is correct
35 Correct 205 ms 102780 KB Output is correct
36 Correct 215 ms 102864 KB Output is correct
37 Correct 211 ms 102648 KB Output is correct
38 Correct 200 ms 102648 KB Output is correct
39 Correct 208 ms 102804 KB Output is correct
40 Correct 132 ms 99192 KB Output is correct
41 Correct 150 ms 99044 KB Output is correct
42 Correct 117 ms 98168 KB Output is correct
43 Correct 122 ms 98144 KB Output is correct
44 Correct 133 ms 99192 KB Output is correct
45 Correct 131 ms 99192 KB Output is correct
46 Correct 125 ms 98296 KB Output is correct
47 Correct 128 ms 98296 KB Output is correct
48 Execution timed out 2604 ms 191864 KB Time limit exceeded
49 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 60 ms 94200 KB Output is correct
2 Correct 60 ms 94200 KB Output is correct
3 Correct 57 ms 94200 KB Output is correct
4 Correct 58 ms 94312 KB Output is correct
5 Correct 58 ms 94200 KB Output is correct
6 Correct 58 ms 94200 KB Output is correct
7 Correct 59 ms 94200 KB Output is correct
8 Correct 59 ms 94200 KB Output is correct
9 Correct 62 ms 94200 KB Output is correct
10 Correct 57 ms 94296 KB Output is correct
11 Correct 58 ms 94200 KB Output is correct
12 Correct 57 ms 94200 KB Output is correct
13 Correct 58 ms 94200 KB Output is correct
14 Correct 61 ms 94328 KB Output is correct
15 Correct 57 ms 94200 KB Output is correct
16 Correct 58 ms 94200 KB Output is correct
17 Correct 59 ms 94204 KB Output is correct
18 Correct 59 ms 94200 KB Output is correct
19 Correct 58 ms 94200 KB Output is correct
20 Correct 60 ms 94328 KB Output is correct
21 Correct 58 ms 94200 KB Output is correct
22 Correct 58 ms 94200 KB Output is correct
23 Correct 57 ms 94200 KB Output is correct
24 Correct 59 ms 94200 KB Output is correct
25 Correct 57 ms 94200 KB Output is correct
26 Correct 59 ms 94200 KB Output is correct
27 Correct 75 ms 94844 KB Output is correct
28 Correct 72 ms 94840 KB Output is correct
29 Correct 83 ms 94840 KB Output is correct
30 Correct 73 ms 94840 KB Output is correct
31 Correct 76 ms 94844 KB Output is correct
32 Correct 72 ms 94840 KB Output is correct
33 Correct 76 ms 94900 KB Output is correct
34 Correct 74 ms 94840 KB Output is correct
35 Correct 205 ms 102780 KB Output is correct
36 Correct 215 ms 102864 KB Output is correct
37 Correct 211 ms 102648 KB Output is correct
38 Correct 200 ms 102648 KB Output is correct
39 Correct 208 ms 102804 KB Output is correct
40 Correct 132 ms 99192 KB Output is correct
41 Correct 150 ms 99044 KB Output is correct
42 Correct 117 ms 98168 KB Output is correct
43 Correct 122 ms 98144 KB Output is correct
44 Correct 133 ms 99192 KB Output is correct
45 Correct 131 ms 99192 KB Output is correct
46 Correct 125 ms 98296 KB Output is correct
47 Correct 128 ms 98296 KB Output is correct
48 Execution timed out 2604 ms 191864 KB Time limit exceeded
49 Halted 0 ms 0 KB -