oj.uz

Submission #200863

# Submission time Handle Problem Language Result Execution time Memory
200863 2020-02-08T10:30:13 Z balbit Rope (JOI17_rope) C++14
80 / 100
 326 ms 103100 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];
int t1[5002][5002], t2[5002][5002];
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]]++;
        }
    }
    REP(i,m){
        ans[i] = n-nof[i];
        REP(j,m){
            if (i!=j){
                
            MN(ans[i], n-nof[i]-nof[j]+t1[i][j]);
            MN(ans[i], n-nof[i]-nof[j]+t2[i][j]);
            }
        }
        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 5 ms 504 KB Output is correct
2 Correct 6 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 380 KB Output is correct
5 Correct 4 ms 376 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 5 ms 504 KB Output is correct
12 Correct 5 ms 504 KB Output is correct
13 Correct 5 ms 504 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 4 ms 376 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 5 ms 376 KB Output is correct
18 Correct 5 ms 376 KB Output is correct
19 Correct 5 ms 376 KB Output is correct
20 Correct 5 ms 376 KB Output is correct
21 Correct 5 ms 376 KB Output is correct
22 Correct 5 ms 376 KB Output is correct
23 Correct 5 ms 380 KB Output is correct
24 Correct 5 ms 376 KB Output is correct
25 Correct 5 ms 376 KB Output is correct
26 Correct 5 ms 376 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 504 KB Output is correct
2 Correct 6 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 380 KB Output is correct
5 Correct 4 ms 376 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 5 ms 504 KB Output is correct
12 Correct 5 ms 504 KB Output is correct
13 Correct 5 ms 504 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 4 ms 376 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 5 ms 376 KB Output is correct
18 Correct 5 ms 376 KB Output is correct
19 Correct 5 ms 376 KB Output is correct
20 Correct 5 ms 376 KB Output is correct
21 Correct 5 ms 376 KB Output is correct
22 Correct 5 ms 376 KB Output is correct
23 Correct 5 ms 380 KB Output is correct
24 Correct 5 ms 376 KB Output is correct
25 Correct 5 ms 376 KB Output is correct
26 Correct 5 ms 376 KB Output is correct
27 Correct 12 ms 888 KB Output is correct
28 Correct 12 ms 760 KB Output is correct
29 Correct 15 ms 760 KB Output is correct
30 Correct 11 ms 760 KB Output is correct
31 Correct 13 ms 888 KB Output is correct
32 Correct 11 ms 760 KB Output is correct
33 Correct 12 ms 760 KB Output is correct
34 Correct 12 ms 760 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 504 KB Output is correct
2 Correct 6 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 380 KB Output is correct
5 Correct 4 ms 376 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 5 ms 504 KB Output is correct
12 Correct 5 ms 504 KB Output is correct
13 Correct 5 ms 504 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 4 ms 376 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 5 ms 376 KB Output is correct
18 Correct 5 ms 376 KB Output is correct
19 Correct 5 ms 376 KB Output is correct
20 Correct 5 ms 376 KB Output is correct
21 Correct 5 ms 376 KB Output is correct
22 Correct 5 ms 376 KB Output is correct
23 Correct 5 ms 380 KB Output is correct
24 Correct 5 ms 376 KB Output is correct
25 Correct 5 ms 376 KB Output is correct
26 Correct 5 ms 376 KB Output is correct
27 Correct 12 ms 888 KB Output is correct
28 Correct 12 ms 760 KB Output is correct
29 Correct 15 ms 760 KB Output is correct
30 Correct 11 ms 760 KB Output is correct
31 Correct 13 ms 888 KB Output is correct
32 Correct 11 ms 760 KB Output is correct
33 Correct 12 ms 760 KB Output is correct
34 Correct 12 ms 760 KB Output is correct
35 Correct 19 ms 6776 KB Output is correct
36 Correct 27 ms 7160 KB Output is correct
37 Correct 20 ms 6776 KB Output is correct
38 Correct 20 ms 6904 KB Output is correct
39 Correct 22 ms 7060 KB Output is correct
40 Correct 19 ms 7160 KB Output is correct
41 Correct 19 ms 7164 KB Output is correct
42 Correct 17 ms 5624 KB Output is correct
43 Correct 17 ms 4216 KB Output is correct
44 Correct 19 ms 7160 KB Output is correct
45 Correct 20 ms 7032 KB Output is correct
46 Correct 19 ms 5624 KB Output is correct
47 Correct 15 ms 4216 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 504 KB Output is correct
2 Correct 6 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 380 KB Output is correct
5 Correct 4 ms 376 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 5 ms 504 KB Output is correct
12 Correct 5 ms 504 KB Output is correct
13 Correct 5 ms 504 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 4 ms 376 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 5 ms 376 KB Output is correct
18 Correct 5 ms 376 KB Output is correct
19 Correct 5 ms 376 KB Output is correct
20 Correct 5 ms 376 KB Output is correct
21 Correct 5 ms 376 KB Output is correct
22 Correct 5 ms 376 KB Output is correct
23 Correct 5 ms 380 KB Output is correct
24 Correct 5 ms 376 KB Output is correct
25 Correct 5 ms 376 KB Output is correct
26 Correct 5 ms 376 KB Output is correct
27 Correct 12 ms 888 KB Output is correct
28 Correct 12 ms 760 KB Output is correct
29 Correct 15 ms 760 KB Output is correct
30 Correct 11 ms 760 KB Output is correct
31 Correct 13 ms 888 KB Output is correct
32 Correct 11 ms 760 KB Output is correct
33 Correct 12 ms 760 KB Output is correct
34 Correct 12 ms 760 KB Output is correct
35 Correct 19 ms 6776 KB Output is correct
36 Correct 27 ms 7160 KB Output is correct
37 Correct 20 ms 6776 KB Output is correct
38 Correct 20 ms 6904 KB Output is correct
39 Correct 22 ms 7060 KB Output is correct
40 Correct 19 ms 7160 KB Output is correct
41 Correct 19 ms 7164 KB Output is correct
42 Correct 17 ms 5624 KB Output is correct
43 Correct 17 ms 4216 KB Output is correct
44 Correct 19 ms 7160 KB Output is correct
45 Correct 20 ms 7032 KB Output is correct
46 Correct 19 ms 5624 KB Output is correct
47 Correct 15 ms 4216 KB Output is correct
48 Correct 326 ms 103100 KB Output is correct
49 Correct 325 ms 103032 KB Output is correct
50 Correct 324 ms 102904 KB Output is correct
51 Correct 253 ms 38136 KB Output is correct
52 Correct 208 ms 23928 KB Output is correct
53 Correct 288 ms 102520 KB Output is correct
54 Correct 289 ms 101240 KB Output is correct
55 Correct 292 ms 101496 KB Output is correct
56 Correct 268 ms 98936 KB Output is correct

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 504 KB Output is correct
2 Correct 6 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 380 KB Output is correct
5 Correct 4 ms 376 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 5 ms 504 KB Output is correct
12 Correct 5 ms 504 KB Output is correct
13 Correct 5 ms 504 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 4 ms 376 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 5 ms 376 KB Output is correct
18 Correct 5 ms 376 KB Output is correct
19 Correct 5 ms 376 KB Output is correct
20 Correct 5 ms 376 KB Output is correct
21 Correct 5 ms 376 KB Output is correct
22 Correct 5 ms 376 KB Output is correct
23 Correct 5 ms 380 KB Output is correct
24 Correct 5 ms 376 KB Output is correct
25 Correct 5 ms 376 KB Output is correct
26 Correct 5 ms 376 KB Output is correct
27 Correct 12 ms 888 KB Output is correct
28 Correct 12 ms 760 KB Output is correct
29 Correct 15 ms 760 KB Output is correct
30 Correct 11 ms 760 KB Output is correct
31 Correct 13 ms 888 KB Output is correct
32 Correct 11 ms 760 KB Output is correct
33 Correct 12 ms 760 KB Output is correct
34 Correct 12 ms 760 KB Output is correct
35 Correct 19 ms 6776 KB Output is correct
36 Correct 27 ms 7160 KB Output is correct
37 Correct 20 ms 6776 KB Output is correct
38 Correct 20 ms 6904 KB Output is correct
39 Correct 22 ms 7060 KB Output is correct
40 Correct 19 ms 7160 KB Output is correct
41 Correct 19 ms 7164 KB Output is correct
42 Correct 17 ms 5624 KB Output is correct
43 Correct 17 ms 4216 KB Output is correct
44 Correct 19 ms 7160 KB Output is correct
45 Correct 20 ms 7032 KB Output is correct
46 Correct 19 ms 5624 KB Output is correct
47 Correct 15 ms 4216 KB Output is correct
48 Correct 326 ms 103100 KB Output is correct
49 Correct 325 ms 103032 KB Output is correct
50 Correct 324 ms 102904 KB Output is correct
51 Correct 253 ms 38136 KB Output is correct
52 Correct 208 ms 23928 KB Output is correct
53 Correct 288 ms 102520 KB Output is correct
54 Correct 289 ms 101240 KB Output is correct
55 Correct 292 ms 101496 KB Output is correct
56 Correct 268 ms 98936 KB Output is correct
57 Runtime error 14 ms 504 KB Execution killed with signal 11 (could be triggered by violating memory limits)
58 Halted 0 ms 0 KB -