oj.uz

Submission #1001080

# Submission time Handle Problem Language Result Execution time Memory
1001080 2024-06-18T14:14:33 Z Otalp Rope (JOI17_rope) C++17
80 / 100
 2500 ms 262132 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
#define h(a, b) (ll)a * 1e7 + b
 
unordered_map<ll, int> dp[2];
int cnt[1000001];
int a[1000001];
unordered_map<int, vector<int>> d;
 

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:65: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]
   65 |             while(ls < g.size() and g[ls].ss == j) ls++;
      |                   ~~~^~~~~~~~~~
rope.cpp:71: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]
   71 |         if(ls < g.size()) ans = min(ans, n-cnt[i]-g[ls].ff);
      |            ~~~^~~~~~~~~~

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 1 ms 344 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 21 ms 2228 KB Output is correct
28 Correct 17 ms 2132 KB Output is correct
29 Correct 18 ms 2140 KB Output is correct
30 Correct 18 ms 2120 KB Output is correct
31 Correct 18 ms 2268 KB Output is correct
32 Correct 18 ms 1880 KB Output is correct
33 Correct 18 ms 2140 KB Output is correct
34 Correct 20 ms 2132 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 21 ms 2228 KB Output is correct
28 Correct 17 ms 2132 KB Output is correct
29 Correct 18 ms 2140 KB Output is correct
30 Correct 18 ms 2120 KB Output is correct
31 Correct 18 ms 2268 KB Output is correct
32 Correct 18 ms 1880 KB Output is correct
33 Correct 18 ms 2140 KB Output is correct
34 Correct 20 ms 2132 KB Output is correct
35 Correct 55 ms 13608 KB Output is correct
36 Correct 59 ms 13608 KB Output is correct
37 Correct 55 ms 13352 KB Output is correct
38 Correct 57 ms 13388 KB Output is correct
39 Correct 64 ms 13620 KB Output is correct
40 Correct 38 ms 8040 KB Output is correct
41 Correct 48 ms 8036 KB Output is correct
42 Correct 37 ms 6756 KB Output is correct
43 Correct 31 ms 5748 KB Output is correct
44 Correct 38 ms 8188 KB Output is correct
45 Correct 38 ms 8232 KB Output is correct
46 Correct 35 ms 6944 KB Output is correct
47 Correct 32 ms 5716 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 21 ms 2228 KB Output is correct
28 Correct 17 ms 2132 KB Output is correct
29 Correct 18 ms 2140 KB Output is correct
30 Correct 18 ms 2120 KB Output is correct
31 Correct 18 ms 2268 KB Output is correct
32 Correct 18 ms 1880 KB Output is correct
33 Correct 18 ms 2140 KB Output is correct
34 Correct 20 ms 2132 KB Output is correct
35 Correct 55 ms 13608 KB Output is correct
36 Correct 59 ms 13608 KB Output is correct
37 Correct 55 ms 13352 KB Output is correct
38 Correct 57 ms 13388 KB Output is correct
39 Correct 64 ms 13620 KB Output is correct
40 Correct 38 ms 8040 KB Output is correct
41 Correct 48 ms 8036 KB Output is correct
42 Correct 37 ms 6756 KB Output is correct
43 Correct 31 ms 5748 KB Output is correct
44 Correct 38 ms 8188 KB Output is correct
45 Correct 38 ms 8232 KB Output is correct
46 Correct 35 ms 6944 KB Output is correct
47 Correct 32 ms 5716 KB Output is correct
48 Correct 1699 ms 177580 KB Output is correct
49 Correct 1683 ms 177520 KB Output is correct
50 Correct 1705 ms 179300 KB Output is correct
51 Correct 1112 ms 126084 KB Output is correct
52 Correct 850 ms 93864 KB Output is correct
53 Correct 852 ms 94764 KB Output is correct
54 Correct 549 ms 62652 KB Output is correct
55 Correct 542 ms 60460 KB Output is correct
56 Correct 486 ms 53172 KB Output is correct

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 21 ms 2228 KB Output is correct
28 Correct 17 ms 2132 KB Output is correct
29 Correct 18 ms 2140 KB Output is correct
30 Correct 18 ms 2120 KB Output is correct
31 Correct 18 ms 2268 KB Output is correct
32 Correct 18 ms 1880 KB Output is correct
33 Correct 18 ms 2140 KB Output is correct
34 Correct 20 ms 2132 KB Output is correct
35 Correct 55 ms 13608 KB Output is correct
36 Correct 59 ms 13608 KB Output is correct
37 Correct 55 ms 13352 KB Output is correct
38 Correct 57 ms 13388 KB Output is correct
39 Correct 64 ms 13620 KB Output is correct
40 Correct 38 ms 8040 KB Output is correct
41 Correct 48 ms 8036 KB Output is correct
42 Correct 37 ms 6756 KB Output is correct
43 Correct 31 ms 5748 KB Output is correct
44 Correct 38 ms 8188 KB Output is correct
45 Correct 38 ms 8232 KB Output is correct
46 Correct 35 ms 6944 KB Output is correct
47 Correct 32 ms 5716 KB Output is correct
48 Correct 1699 ms 177580 KB Output is correct
49 Correct 1683 ms 177520 KB Output is correct
50 Correct 1705 ms 179300 KB Output is correct
51 Correct 1112 ms 126084 KB Output is correct
52 Correct 850 ms 93864 KB Output is correct
53 Correct 852 ms 94764 KB Output is correct
54 Correct 549 ms 62652 KB Output is correct
55 Correct 542 ms 60460 KB Output is correct
56 Correct 486 ms 53172 KB Output is correct
57 Execution timed out 2538 ms 262132 KB Time limit exceeded
58 Halted 0 ms 0 KB -