oj.uz

Submission #1001055

# Submission time Handle Problem Language Result Execution time Memory
1001055 2024-06-18T13:52:23 Z Otalp Rope (JOI17_rope) C++17
55 / 100
 2500 ms 241712 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<pii, int> dp[2];
int cnt[1001000];
int a[1001000];
map<int, vector<int>> d;
 

bool cmp(int a, int b){
    if(cnt[a] == cnt[b]) return a > b;
    return cnt[a] > cnt[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][{l, r}] ++;
        dp[1][{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][{l, r}] ++;
        dp[0][{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][{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:60: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]
   60 |             while(ls < g.size() and g[ls].ss == j) ls++;
      |                   ~~~^~~~~~~~~~
rope.cpp:66: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]
   66 |         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 1 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 0 ms 2396 KB Output is correct
12 Correct 0 ms 2396 KB Output is correct
13 Correct 0 ms 2396 KB Output is correct
14 Correct 0 ms 2396 KB Output is correct
15 Correct 0 ms 2396 KB Output is correct
16 Correct 0 ms 2396 KB Output is correct
17 Correct 0 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 0 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 0 ms 2396 KB Output is correct
22 Correct 0 ms 2396 KB Output is correct
23 Correct 1 ms 2396 KB Output is correct
24 Correct 0 ms 2396 KB Output is correct
25 Correct 0 ms 2396 KB Output is correct
26 Correct 0 ms 2396 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 0 ms 2396 KB Output is correct
12 Correct 0 ms 2396 KB Output is correct
13 Correct 0 ms 2396 KB Output is correct
14 Correct 0 ms 2396 KB Output is correct
15 Correct 0 ms 2396 KB Output is correct
16 Correct 0 ms 2396 KB Output is correct
17 Correct 0 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 0 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 0 ms 2396 KB Output is correct
22 Correct 0 ms 2396 KB Output is correct
23 Correct 1 ms 2396 KB Output is correct
24 Correct 0 ms 2396 KB Output is correct
25 Correct 0 ms 2396 KB Output is correct
26 Correct 0 ms 2396 KB Output is correct
27 Correct 24 ms 5980 KB Output is correct
28 Correct 19 ms 5716 KB Output is correct
29 Correct 24 ms 5836 KB Output is correct
30 Correct 20 ms 5676 KB Output is correct
31 Correct 25 ms 5964 KB Output is correct
32 Correct 25 ms 5672 KB Output is correct
33 Correct 24 ms 5720 KB Output is correct
34 Correct 20 ms 5844 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 0 ms 2396 KB Output is correct
12 Correct 0 ms 2396 KB Output is correct
13 Correct 0 ms 2396 KB Output is correct
14 Correct 0 ms 2396 KB Output is correct
15 Correct 0 ms 2396 KB Output is correct
16 Correct 0 ms 2396 KB Output is correct
17 Correct 0 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 0 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 0 ms 2396 KB Output is correct
22 Correct 0 ms 2396 KB Output is correct
23 Correct 1 ms 2396 KB Output is correct
24 Correct 0 ms 2396 KB Output is correct
25 Correct 0 ms 2396 KB Output is correct
26 Correct 0 ms 2396 KB Output is correct
27 Correct 24 ms 5980 KB Output is correct
28 Correct 19 ms 5716 KB Output is correct
29 Correct 24 ms 5836 KB Output is correct
30 Correct 20 ms 5676 KB Output is correct
31 Correct 25 ms 5964 KB Output is correct
32 Correct 25 ms 5672 KB Output is correct
33 Correct 24 ms 5720 KB Output is correct
34 Correct 20 ms 5844 KB Output is correct
35 Correct 129 ms 22868 KB Output is correct
36 Correct 137 ms 22824 KB Output is correct
37 Correct 131 ms 22352 KB Output is correct
38 Correct 134 ms 22608 KB Output is correct
39 Correct 140 ms 23004 KB Output is correct
40 Correct 96 ms 14488 KB Output is correct
41 Correct 78 ms 14464 KB Output is correct
42 Correct 65 ms 11988 KB Output is correct
43 Correct 63 ms 11088 KB Output is correct
44 Correct 86 ms 14816 KB Output is correct
45 Correct 80 ms 14832 KB Output is correct
46 Correct 72 ms 12296 KB Output is correct
47 Correct 66 ms 11092 KB Output is correct

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 0 ms 2396 KB Output is correct
12 Correct 0 ms 2396 KB Output is correct
13 Correct 0 ms 2396 KB Output is correct
14 Correct 0 ms 2396 KB Output is correct
15 Correct 0 ms 2396 KB Output is correct
16 Correct 0 ms 2396 KB Output is correct
17 Correct 0 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 0 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 0 ms 2396 KB Output is correct
22 Correct 0 ms 2396 KB Output is correct
23 Correct 1 ms 2396 KB Output is correct
24 Correct 0 ms 2396 KB Output is correct
25 Correct 0 ms 2396 KB Output is correct
26 Correct 0 ms 2396 KB Output is correct
27 Correct 24 ms 5980 KB Output is correct
28 Correct 19 ms 5716 KB Output is correct
29 Correct 24 ms 5836 KB Output is correct
30 Correct 20 ms 5676 KB Output is correct
31 Correct 25 ms 5964 KB Output is correct
32 Correct 25 ms 5672 KB Output is correct
33 Correct 24 ms 5720 KB Output is correct
34 Correct 20 ms 5844 KB Output is correct
35 Correct 129 ms 22868 KB Output is correct
36 Correct 137 ms 22824 KB Output is correct
37 Correct 131 ms 22352 KB Output is correct
38 Correct 134 ms 22608 KB Output is correct
39 Correct 140 ms 23004 KB Output is correct
40 Correct 96 ms 14488 KB Output is correct
41 Correct 78 ms 14464 KB Output is correct
42 Correct 65 ms 11988 KB Output is correct
43 Correct 63 ms 11088 KB Output is correct
44 Correct 86 ms 14816 KB Output is correct
45 Correct 80 ms 14832 KB Output is correct
46 Correct 72 ms 12296 KB Output is correct
47 Correct 66 ms 11092 KB Output is correct
48 Execution timed out 2573 ms 241712 KB Time limit exceeded
49 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 0 ms 2396 KB Output is correct
12 Correct 0 ms 2396 KB Output is correct
13 Correct 0 ms 2396 KB Output is correct
14 Correct 0 ms 2396 KB Output is correct
15 Correct 0 ms 2396 KB Output is correct
16 Correct 0 ms 2396 KB Output is correct
17 Correct 0 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 0 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 0 ms 2396 KB Output is correct
22 Correct 0 ms 2396 KB Output is correct
23 Correct 1 ms 2396 KB Output is correct
24 Correct 0 ms 2396 KB Output is correct
25 Correct 0 ms 2396 KB Output is correct
26 Correct 0 ms 2396 KB Output is correct
27 Correct 24 ms 5980 KB Output is correct
28 Correct 19 ms 5716 KB Output is correct
29 Correct 24 ms 5836 KB Output is correct
30 Correct 20 ms 5676 KB Output is correct
31 Correct 25 ms 5964 KB Output is correct
32 Correct 25 ms 5672 KB Output is correct
33 Correct 24 ms 5720 KB Output is correct
34 Correct 20 ms 5844 KB Output is correct
35 Correct 129 ms 22868 KB Output is correct
36 Correct 137 ms 22824 KB Output is correct
37 Correct 131 ms 22352 KB Output is correct
38 Correct 134 ms 22608 KB Output is correct
39 Correct 140 ms 23004 KB Output is correct
40 Correct 96 ms 14488 KB Output is correct
41 Correct 78 ms 14464 KB Output is correct
42 Correct 65 ms 11988 KB Output is correct
43 Correct 63 ms 11088 KB Output is correct
44 Correct 86 ms 14816 KB Output is correct
45 Correct 80 ms 14832 KB Output is correct
46 Correct 72 ms 12296 KB Output is correct
47 Correct 66 ms 11092 KB Output is correct
48 Execution timed out 2573 ms 241712 KB Time limit exceeded
49 Halted 0 ms 0 KB -