oj.uz

답안 #1001075

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1001075 2024-06-18T14:10:15 Z Otalp Rope (JOI17_rope) C++14
55 / 100
 1942 ms 262144 KB 
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define ff first
#define ss second
#define pb push_back
 
map<ll, int> dp[2];
int cnt[5001];
int a[1000001];
vector<int> d[1000001];
 

bool cmp(int a, int b){
    if(cnt[a] == cnt[b]) return a > b;
    return cnt[a] > cnt[b];
}

ll h(ll a, ll b){ //hynya
    return a * 1e7 + b;
}
 
void solve(){
    int n, m;
    cin>>n>>m;
    for(int i=1; i<=n; i++){
        cin>>a[i];
        cnt[a[i]] ++;
    }
    vector<pii> g;
    for(int i=1; i<=m; i++){
        g.pb({cnt[i], i});
    }
    sort(g.begin(), g.end(), greater<pii>());
 
    for(int i=1; i+1<=n; i+=2){
        int l=a[i], r=a[i + 1];
        dp[1][h(l, r)] ++;
        dp[1][h(r, l)] ++;
        d[l].pb(r);
        d[r].pb(l);
    }
    for(int i=2; i+1<=n; i+=2){
        int l=a[i], r=a[i + 1];
        dp[0][h(l, r)] ++;
        dp[0][h(r, l)] ++;
        d[l].pb(r);
        d[r].pb(l);
    }
    ll dd = 0;
    for(int i=1; i<=m; i++) dd += d[i].size();
    if(dd > 2e6) return;
    if(g.size() == 0 or g.size() > 1e6) return;
    if(dp[0].size() + dp[1].size() > 2e6) return;
    for(int i=1; i<=m; i++){
        d[i].pb(i);
        sort(d[i].begin(), d[i].end(), cmp);
    }
    for(int i=1; i<=m; i++){
        int ans = n - cnt[i];
        int ls = 0;
        for(int j: d[i]){
            while(ls < g.size() and g[ls].ss == j) ls++;
            if(j == i) continue;
            for(int k=0; k<2; k++){ 
                ans = min(ans, n-cnt[i]-cnt[j]+dp[k][h(i, j)]);
            }
        }
        if(ls < g.size()) ans = min(ans, n-cnt[i]-g[ls].ff);
        cout<<ans<<'\n';
    }
}


signed main(){
    ios_base::sync_with_stdio(NULL), cin.tie(NULL), cout.tie(NULL);
    solve();
}

Compilation message

rope.cpp: In function 'void solve()':
rope.cpp:64:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   64 |             while(ls < g.size() and g[ls].ss == j) ls++;
      |                   ~~~^~~~~~~~~~
rope.cpp:70:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   70 |         if(ls < g.size()) ans = min(ans, n-cnt[i]-g[ls].ff);
      |            ~~~^~~~~~~~~~

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 25180 KB Output is correct
2 Correct 4 ms 25180 KB Output is correct
3 Correct 4 ms 25180 KB Output is correct
4 Correct 4 ms 25180 KB Output is correct
5 Correct 4 ms 25180 KB Output is correct
6 Correct 4 ms 25180 KB Output is correct
7 Correct 4 ms 25180 KB Output is correct
8 Correct 4 ms 25180 KB Output is correct
9 Correct 4 ms 25180 KB Output is correct
10 Correct 4 ms 25176 KB Output is correct
11 Correct 4 ms 25180 KB Output is correct
12 Correct 4 ms 25180 KB Output is correct
13 Correct 4 ms 25176 KB Output is correct
14 Correct 4 ms 25200 KB Output is correct
15 Correct 4 ms 25192 KB Output is correct
16 Correct 4 ms 25180 KB Output is correct
17 Correct 4 ms 25180 KB Output is correct
18 Correct 4 ms 25180 KB Output is correct
19 Correct 5 ms 25248 KB Output is correct
20 Correct 4 ms 25176 KB Output is correct
21 Correct 4 ms 25176 KB Output is correct
22 Correct 4 ms 25180 KB Output is correct
23 Correct 4 ms 25180 KB Output is correct
24 Correct 4 ms 25176 KB Output is correct
25 Correct 5 ms 25180 KB Output is correct
26 Correct 4 ms 25180 KB Output is correct

Subtask #2
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 25180 KB Output is correct
2 Correct 4 ms 25180 KB Output is correct
3 Correct 4 ms 25180 KB Output is correct
4 Correct 4 ms 25180 KB Output is correct
5 Correct 4 ms 25180 KB Output is correct
6 Correct 4 ms 25180 KB Output is correct
7 Correct 4 ms 25180 KB Output is correct
8 Correct 4 ms 25180 KB Output is correct
9 Correct 4 ms 25180 KB Output is correct
10 Correct 4 ms 25176 KB Output is correct
11 Correct 4 ms 25180 KB Output is correct
12 Correct 4 ms 25180 KB Output is correct
13 Correct 4 ms 25176 KB Output is correct
14 Correct 4 ms 25200 KB Output is correct
15 Correct 4 ms 25192 KB Output is correct
16 Correct 4 ms 25180 KB Output is correct
17 Correct 4 ms 25180 KB Output is correct
18 Correct 4 ms 25180 KB Output is correct
19 Correct 5 ms 25248 KB Output is correct
20 Correct 4 ms 25176 KB Output is correct
21 Correct 4 ms 25176 KB Output is correct
22 Correct 4 ms 25180 KB Output is correct
23 Correct 4 ms 25180 KB Output is correct
24 Correct 4 ms 25176 KB Output is correct
25 Correct 5 ms 25180 KB Output is correct
26 Correct 4 ms 25180 KB Output is correct
27 Correct 26 ms 26628 KB Output is correct
28 Correct 21 ms 26352 KB Output is correct
29 Correct 24 ms 26204 KB Output is correct
30 Correct 21 ms 26208 KB Output is correct
31 Correct 26 ms 26280 KB Output is correct
32 Correct 22 ms 26136 KB Output is correct
33 Correct 26 ms 26204 KB Output is correct
34 Correct 22 ms 26328 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 25180 KB Output is correct
2 Correct 4 ms 25180 KB Output is correct
3 Correct 4 ms 25180 KB Output is correct
4 Correct 4 ms 25180 KB Output is correct
5 Correct 4 ms 25180 KB Output is correct
6 Correct 4 ms 25180 KB Output is correct
7 Correct 4 ms 25180 KB Output is correct
8 Correct 4 ms 25180 KB Output is correct
9 Correct 4 ms 25180 KB Output is correct
10 Correct 4 ms 25176 KB Output is correct
11 Correct 4 ms 25180 KB Output is correct
12 Correct 4 ms 25180 KB Output is correct
13 Correct 4 ms 25176 KB Output is correct
14 Correct 4 ms 25200 KB Output is correct
15 Correct 4 ms 25192 KB Output is correct
16 Correct 4 ms 25180 KB Output is correct
17 Correct 4 ms 25180 KB Output is correct
18 Correct 4 ms 25180 KB Output is correct
19 Correct 5 ms 25248 KB Output is correct
20 Correct 4 ms 25176 KB Output is correct
21 Correct 4 ms 25176 KB Output is correct
22 Correct 4 ms 25180 KB Output is correct
23 Correct 4 ms 25180 KB Output is correct
24 Correct 4 ms 25176 KB Output is correct
25 Correct 5 ms 25180 KB Output is correct
26 Correct 4 ms 25180 KB Output is correct
27 Correct 26 ms 26628 KB Output is correct
28 Correct 21 ms 26352 KB Output is correct
29 Correct 24 ms 26204 KB Output is correct
30 Correct 21 ms 26208 KB Output is correct
31 Correct 26 ms 26280 KB Output is correct
32 Correct 22 ms 26136 KB Output is correct
33 Correct 26 ms 26204 KB Output is correct
34 Correct 22 ms 26328 KB Output is correct
35 Correct 122 ms 43528 KB Output is correct
36 Correct 117 ms 43388 KB Output is correct
37 Correct 123 ms 42832 KB Output is correct
38 Correct 121 ms 43088 KB Output is correct
39 Correct 119 ms 43344 KB Output is correct
40 Correct 72 ms 35152 KB Output is correct
41 Correct 75 ms 34900 KB Output is correct
42 Correct 59 ms 32596 KB Output is correct
43 Correct 60 ms 31572 KB Output is correct
44 Correct 75 ms 35412 KB Output is correct
45 Correct 71 ms 35156 KB Output is correct
46 Correct 70 ms 32664 KB Output is correct
47 Correct 62 ms 31788 KB Output is correct

Subtask #4
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 25180 KB Output is correct
2 Correct 4 ms 25180 KB Output is correct
3 Correct 4 ms 25180 KB Output is correct
4 Correct 4 ms 25180 KB Output is correct
5 Correct 4 ms 25180 KB Output is correct
6 Correct 4 ms 25180 KB Output is correct
7 Correct 4 ms 25180 KB Output is correct
8 Correct 4 ms 25180 KB Output is correct
9 Correct 4 ms 25180 KB Output is correct
10 Correct 4 ms 25176 KB Output is correct
11 Correct 4 ms 25180 KB Output is correct
12 Correct 4 ms 25180 KB Output is correct
13 Correct 4 ms 25176 KB Output is correct
14 Correct 4 ms 25200 KB Output is correct
15 Correct 4 ms 25192 KB Output is correct
16 Correct 4 ms 25180 KB Output is correct
17 Correct 4 ms 25180 KB Output is correct
18 Correct 4 ms 25180 KB Output is correct
19 Correct 5 ms 25248 KB Output is correct
20 Correct 4 ms 25176 KB Output is correct
21 Correct 4 ms 25176 KB Output is correct
22 Correct 4 ms 25180 KB Output is correct
23 Correct 4 ms 25180 KB Output is correct
24 Correct 4 ms 25176 KB Output is correct
25 Correct 5 ms 25180 KB Output is correct
26 Correct 4 ms 25180 KB Output is correct
27 Correct 26 ms 26628 KB Output is correct
28 Correct 21 ms 26352 KB Output is correct
29 Correct 24 ms 26204 KB Output is correct
30 Correct 21 ms 26208 KB Output is correct
31 Correct 26 ms 26280 KB Output is correct
32 Correct 22 ms 26136 KB Output is correct
33 Correct 26 ms 26204 KB Output is correct
34 Correct 22 ms 26328 KB Output is correct
35 Correct 122 ms 43528 KB Output is correct
36 Correct 117 ms 43388 KB Output is correct
37 Correct 123 ms 42832 KB Output is correct
38 Correct 121 ms 43088 KB Output is correct
39 Correct 119 ms 43344 KB Output is correct
40 Correct 72 ms 35152 KB Output is correct
41 Correct 75 ms 34900 KB Output is correct
42 Correct 59 ms 32596 KB Output is correct
43 Correct 60 ms 31572 KB Output is correct
44 Correct 75 ms 35412 KB Output is correct
45 Correct 71 ms 35156 KB Output is correct
46 Correct 70 ms 32664 KB Output is correct
47 Correct 62 ms 31788 KB Output is correct
48 Runtime error 1942 ms 262144 KB Execution killed with signal 9
49 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 25180 KB Output is correct
2 Correct 4 ms 25180 KB Output is correct
3 Correct 4 ms 25180 KB Output is correct
4 Correct 4 ms 25180 KB Output is correct
5 Correct 4 ms 25180 KB Output is correct
6 Correct 4 ms 25180 KB Output is correct
7 Correct 4 ms 25180 KB Output is correct
8 Correct 4 ms 25180 KB Output is correct
9 Correct 4 ms 25180 KB Output is correct
10 Correct 4 ms 25176 KB Output is correct
11 Correct 4 ms 25180 KB Output is correct
12 Correct 4 ms 25180 KB Output is correct
13 Correct 4 ms 25176 KB Output is correct
14 Correct 4 ms 25200 KB Output is correct
15 Correct 4 ms 25192 KB Output is correct
16 Correct 4 ms 25180 KB Output is correct
17 Correct 4 ms 25180 KB Output is correct
18 Correct 4 ms 25180 KB Output is correct
19 Correct 5 ms 25248 KB Output is correct
20 Correct 4 ms 25176 KB Output is correct
21 Correct 4 ms 25176 KB Output is correct
22 Correct 4 ms 25180 KB Output is correct
23 Correct 4 ms 25180 KB Output is correct
24 Correct 4 ms 25176 KB Output is correct
25 Correct 5 ms 25180 KB Output is correct
26 Correct 4 ms 25180 KB Output is correct
27 Correct 26 ms 26628 KB Output is correct
28 Correct 21 ms 26352 KB Output is correct
29 Correct 24 ms 26204 KB Output is correct
30 Correct 21 ms 26208 KB Output is correct
31 Correct 26 ms 26280 KB Output is correct
32 Correct 22 ms 26136 KB Output is correct
33 Correct 26 ms 26204 KB Output is correct
34 Correct 22 ms 26328 KB Output is correct
35 Correct 122 ms 43528 KB Output is correct
36 Correct 117 ms 43388 KB Output is correct
37 Correct 123 ms 42832 KB Output is correct
38 Correct 121 ms 43088 KB Output is correct
39 Correct 119 ms 43344 KB Output is correct
40 Correct 72 ms 35152 KB Output is correct
41 Correct 75 ms 34900 KB Output is correct
42 Correct 59 ms 32596 KB Output is correct
43 Correct 60 ms 31572 KB Output is correct
44 Correct 75 ms 35412 KB Output is correct
45 Correct 71 ms 35156 KB Output is correct
46 Correct 70 ms 32664 KB Output is correct
47 Correct 62 ms 31788 KB Output is correct
48 Runtime error 1942 ms 262144 KB Execution killed with signal 9
49 Halted 0 ms 0 KB -