oj.uz

Submission #200878

# Submission time Handle Problem Language Result Execution time Memory
200878 2020-02-08T11:17:49 Z balbit Rope (JOI17_rope) C++11
55 / 100
 2500 ms 187456 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define ull unsigned ll
#define f first
#define s second
#define FOR(i,a,b) for (int i=(a); i<(b); ++i)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) for (int i=(n-1); i>=0; --i)
#define REP1(i,n) FOR(i,1,n+1)
#define ALL(x) x.begin(),x.end()
#define SZ(x) (int)x.size()
#define SQ(x) (x)*(x)
#define MN(a,b) a = min(a,(__typeof__(a))(b))
#define MX(a,b) a = max(a,(__typeof__(a))(b))
#define pb push_back
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#ifdef BALBIT
#define IOS()
#define bug(...) fprintf(stderr,"#%d (%s) = ",__LINE__,#__VA_ARGS__),_do(__VA_ARGS__);
template<typename T> void _do(T &&x){cerr<<x<<endl;}
template<typename T, typename ...S> void _do(T &&x, S &&...y){cerr<<x<<", ";_do(y...);}
#else
#define IOS() ios_base::sync_with_stdio(0);cin.tie(0);
#define endl '\n'
#define bug(...)
#endif

const int iinf = 1<<29;
const ll inf = 1ll<<60;
const ll mod = 1e9+7;


void GG(){cout<<"-1\n"; exit(0);}

ll mpow(ll a, ll n, ll mo = mod){ // a^n % mod
    ll re=1;
    while (n>0){
        if (n&1) re = re*a %mo;
        a = a*a %mo;
        n>>=1;
    }
    return re;
}

ll inv (ll b){
    return b==1?1:(mod-mod/b) * inv(mod%b) % mod;
}

const int maxn = 1e6+5;

int ans[maxn];
map<int, int> t1[maxn], t2[maxn];
int nof[maxn], A[maxn];

signed main(){
    IOS();
    int n;cin>>n;
    int m; cin>>m;
    REP(i,n) {
        cin>>A[i];
        A[i]--;
        nof[A[i]]++;
        if (i==0 || A[i] == A[i-1]) continue;
        if (i%2==0){
            t2[A[i-1]][A[i]]++;
            t2[A[i]][A[i-1]]++;
        }else{
            t1[A[i-1]][A[i]]++;
            t1[A[i]][A[i-1]]++;
        }
    }
    vector<pii> vn;
    REP(i,m){
        vn.pb({nof[i],i});
    }
    sort(ALL(vn),greater<pii>());
    REP(i,m){
        ans[i] = n-nof[i];
        REP(it, SZ(vn)){
            int j = vn[it].s;
            if (j == i) continue;
            if (t1[i].count(j) && t2[i].count(j)) {
                MN(ans[i],n-nof[i]-nof[j]+min(t1[i][j],t2[i][j]));
            }else{
                MN(ans[i],n-nof[i]-nof[j]); break;
            }
        }
        cout<<ans[i]<<endl;
    }
    // Check your array bounds!
    // Think about corner cases (smallest or biggest?)
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 61 ms 94328 KB Output is correct
2 Correct 59 ms 94328 KB Output is correct
3 Correct 61 ms 94328 KB Output is correct
4 Correct 59 ms 94328 KB Output is correct
5 Correct 60 ms 94304 KB Output is correct
6 Correct 60 ms 94328 KB Output is correct
7 Correct 61 ms 94328 KB Output is correct
8 Correct 66 ms 94328 KB Output is correct
9 Correct 59 ms 94328 KB Output is correct
10 Correct 60 ms 94328 KB Output is correct
11 Correct 61 ms 94328 KB Output is correct
12 Correct 60 ms 94328 KB Output is correct
13 Correct 60 ms 94328 KB Output is correct
14 Correct 58 ms 94328 KB Output is correct
15 Correct 60 ms 94328 KB Output is correct
16 Correct 60 ms 94328 KB Output is correct
17 Correct 62 ms 94328 KB Output is correct
18 Correct 60 ms 94328 KB Output is correct
19 Correct 59 ms 94328 KB Output is correct
20 Correct 60 ms 94328 KB Output is correct
21 Correct 59 ms 94328 KB Output is correct
22 Correct 63 ms 94328 KB Output is correct
23 Correct 61 ms 94328 KB Output is correct
24 Correct 60 ms 94328 KB Output is correct
25 Correct 60 ms 94332 KB Output is correct
26 Correct 61 ms 94456 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 61 ms 94328 KB Output is correct
2 Correct 59 ms 94328 KB Output is correct
3 Correct 61 ms 94328 KB Output is correct
4 Correct 59 ms 94328 KB Output is correct
5 Correct 60 ms 94304 KB Output is correct
6 Correct 60 ms 94328 KB Output is correct
7 Correct 61 ms 94328 KB Output is correct
8 Correct 66 ms 94328 KB Output is correct
9 Correct 59 ms 94328 KB Output is correct
10 Correct 60 ms 94328 KB Output is correct
11 Correct 61 ms 94328 KB Output is correct
12 Correct 60 ms 94328 KB Output is correct
13 Correct 60 ms 94328 KB Output is correct
14 Correct 58 ms 94328 KB Output is correct
15 Correct 60 ms 94328 KB Output is correct
16 Correct 60 ms 94328 KB Output is correct
17 Correct 62 ms 94328 KB Output is correct
18 Correct 60 ms 94328 KB Output is correct
19 Correct 59 ms 94328 KB Output is correct
20 Correct 60 ms 94328 KB Output is correct
21 Correct 59 ms 94328 KB Output is correct
22 Correct 63 ms 94328 KB Output is correct
23 Correct 61 ms 94328 KB Output is correct
24 Correct 60 ms 94328 KB Output is correct
25 Correct 60 ms 94332 KB Output is correct
26 Correct 61 ms 94456 KB Output is correct
27 Correct 72 ms 94712 KB Output is correct
28 Correct 69 ms 94712 KB Output is correct
29 Correct 73 ms 94712 KB Output is correct
30 Correct 68 ms 94712 KB Output is correct
31 Correct 71 ms 94712 KB Output is correct
32 Correct 69 ms 94712 KB Output is correct
33 Correct 73 ms 94712 KB Output is correct
34 Correct 70 ms 94712 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 61 ms 94328 KB Output is correct
2 Correct 59 ms 94328 KB Output is correct
3 Correct 61 ms 94328 KB Output is correct
4 Correct 59 ms 94328 KB Output is correct
5 Correct 60 ms 94304 KB Output is correct
6 Correct 60 ms 94328 KB Output is correct
7 Correct 61 ms 94328 KB Output is correct
8 Correct 66 ms 94328 KB Output is correct
9 Correct 59 ms 94328 KB Output is correct
10 Correct 60 ms 94328 KB Output is correct
11 Correct 61 ms 94328 KB Output is correct
12 Correct 60 ms 94328 KB Output is correct
13 Correct 60 ms 94328 KB Output is correct
14 Correct 58 ms 94328 KB Output is correct
15 Correct 60 ms 94328 KB Output is correct
16 Correct 60 ms 94328 KB Output is correct
17 Correct 62 ms 94328 KB Output is correct
18 Correct 60 ms 94328 KB Output is correct
19 Correct 59 ms 94328 KB Output is correct
20 Correct 60 ms 94328 KB Output is correct
21 Correct 59 ms 94328 KB Output is correct
22 Correct 63 ms 94328 KB Output is correct
23 Correct 61 ms 94328 KB Output is correct
24 Correct 60 ms 94328 KB Output is correct
25 Correct 60 ms 94332 KB Output is correct
26 Correct 61 ms 94456 KB Output is correct
27 Correct 72 ms 94712 KB Output is correct
28 Correct 69 ms 94712 KB Output is correct
29 Correct 73 ms 94712 KB Output is correct
30 Correct 68 ms 94712 KB Output is correct
31 Correct 71 ms 94712 KB Output is correct
32 Correct 69 ms 94712 KB Output is correct
33 Correct 73 ms 94712 KB Output is correct
34 Correct 70 ms 94712 KB Output is correct
35 Correct 148 ms 102392 KB Output is correct
36 Correct 149 ms 102392 KB Output is correct
37 Correct 151 ms 102264 KB Output is correct
38 Correct 148 ms 102392 KB Output is correct
39 Correct 150 ms 102520 KB Output is correct
40 Correct 103 ms 98856 KB Output is correct
41 Correct 104 ms 98936 KB Output is correct
42 Correct 97 ms 97912 KB Output is correct
43 Correct 95 ms 97656 KB Output is correct
44 Correct 139 ms 98808 KB Output is correct
45 Correct 101 ms 98808 KB Output is correct
46 Correct 97 ms 97912 KB Output is correct
47 Correct 97 ms 97784 KB Output is correct

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 61 ms 94328 KB Output is correct
2 Correct 59 ms 94328 KB Output is correct
3 Correct 61 ms 94328 KB Output is correct
4 Correct 59 ms 94328 KB Output is correct
5 Correct 60 ms 94304 KB Output is correct
6 Correct 60 ms 94328 KB Output is correct
7 Correct 61 ms 94328 KB Output is correct
8 Correct 66 ms 94328 KB Output is correct
9 Correct 59 ms 94328 KB Output is correct
10 Correct 60 ms 94328 KB Output is correct
11 Correct 61 ms 94328 KB Output is correct
12 Correct 60 ms 94328 KB Output is correct
13 Correct 60 ms 94328 KB Output is correct
14 Correct 58 ms 94328 KB Output is correct
15 Correct 60 ms 94328 KB Output is correct
16 Correct 60 ms 94328 KB Output is correct
17 Correct 62 ms 94328 KB Output is correct
18 Correct 60 ms 94328 KB Output is correct
19 Correct 59 ms 94328 KB Output is correct
20 Correct 60 ms 94328 KB Output is correct
21 Correct 59 ms 94328 KB Output is correct
22 Correct 63 ms 94328 KB Output is correct
23 Correct 61 ms 94328 KB Output is correct
24 Correct 60 ms 94328 KB Output is correct
25 Correct 60 ms 94332 KB Output is correct
26 Correct 61 ms 94456 KB Output is correct
27 Correct 72 ms 94712 KB Output is correct
28 Correct 69 ms 94712 KB Output is correct
29 Correct 73 ms 94712 KB Output is correct
30 Correct 68 ms 94712 KB Output is correct
31 Correct 71 ms 94712 KB Output is correct
32 Correct 69 ms 94712 KB Output is correct
33 Correct 73 ms 94712 KB Output is correct
34 Correct 70 ms 94712 KB Output is correct
35 Correct 148 ms 102392 KB Output is correct
36 Correct 149 ms 102392 KB Output is correct
37 Correct 151 ms 102264 KB Output is correct
38 Correct 148 ms 102392 KB Output is correct
39 Correct 150 ms 102520 KB Output is correct
40 Correct 103 ms 98856 KB Output is correct
41 Correct 104 ms 98936 KB Output is correct
42 Correct 97 ms 97912 KB Output is correct
43 Correct 95 ms 97656 KB Output is correct
44 Correct 139 ms 98808 KB Output is correct
45 Correct 101 ms 98808 KB Output is correct
46 Correct 97 ms 97912 KB Output is correct
47 Correct 97 ms 97784 KB Output is correct
48 Execution timed out 2555 ms 187456 KB Time limit exceeded
49 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 61 ms 94328 KB Output is correct
2 Correct 59 ms 94328 KB Output is correct
3 Correct 61 ms 94328 KB Output is correct
4 Correct 59 ms 94328 KB Output is correct
5 Correct 60 ms 94304 KB Output is correct
6 Correct 60 ms 94328 KB Output is correct
7 Correct 61 ms 94328 KB Output is correct
8 Correct 66 ms 94328 KB Output is correct
9 Correct 59 ms 94328 KB Output is correct
10 Correct 60 ms 94328 KB Output is correct
11 Correct 61 ms 94328 KB Output is correct
12 Correct 60 ms 94328 KB Output is correct
13 Correct 60 ms 94328 KB Output is correct
14 Correct 58 ms 94328 KB Output is correct
15 Correct 60 ms 94328 KB Output is correct
16 Correct 60 ms 94328 KB Output is correct
17 Correct 62 ms 94328 KB Output is correct
18 Correct 60 ms 94328 KB Output is correct
19 Correct 59 ms 94328 KB Output is correct
20 Correct 60 ms 94328 KB Output is correct
21 Correct 59 ms 94328 KB Output is correct
22 Correct 63 ms 94328 KB Output is correct
23 Correct 61 ms 94328 KB Output is correct
24 Correct 60 ms 94328 KB Output is correct
25 Correct 60 ms 94332 KB Output is correct
26 Correct 61 ms 94456 KB Output is correct
27 Correct 72 ms 94712 KB Output is correct
28 Correct 69 ms 94712 KB Output is correct
29 Correct 73 ms 94712 KB Output is correct
30 Correct 68 ms 94712 KB Output is correct
31 Correct 71 ms 94712 KB Output is correct
32 Correct 69 ms 94712 KB Output is correct
33 Correct 73 ms 94712 KB Output is correct
34 Correct 70 ms 94712 KB Output is correct
35 Correct 148 ms 102392 KB Output is correct
36 Correct 149 ms 102392 KB Output is correct
37 Correct 151 ms 102264 KB Output is correct
38 Correct 148 ms 102392 KB Output is correct
39 Correct 150 ms 102520 KB Output is correct
40 Correct 103 ms 98856 KB Output is correct
41 Correct 104 ms 98936 KB Output is correct
42 Correct 97 ms 97912 KB Output is correct
43 Correct 95 ms 97656 KB Output is correct
44 Correct 139 ms 98808 KB Output is correct
45 Correct 101 ms 98808 KB Output is correct
46 Correct 97 ms 97912 KB Output is correct
47 Correct 97 ms 97784 KB Output is correct
48 Execution timed out 2555 ms 187456 KB Time limit exceeded
49 Halted 0 ms 0 KB -