답안 #200847

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
200847	2020-02-08T10:05:32 Z	balbit	Rope (JOI17_rope)	C++14	45 / 100	2500 ms	1528 KB

rope

#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 = 1e5+5;

int nof[maxn][10]; // Number of this color, 0-based
int a[maxn];
int dp[maxn];

signed main(){
    IOS();
    int n, m; cin>>n>>m;
    REP(i,n){
        cin>>a[i]; -- a[i];
    }
    REP(M,m){
        int re = iinf;
        REP(M2,m){
            dp[0]=0;
            REP1(i,n){
                dp[i] = iinf;
                if (i == 1 || i == n) {
                    MN(dp[i], dp[i-1] + (a[i-1]!=M && a[i-1]!=M2));
                }
                if (i > 1){
                    MN(dp[i], dp[i-2] + min((a[i-1]!=M)+(a[i-2]!=M),(a[i-1]!=M2)+(a[i-2]!=M2)));
                }
            }
            MN(re, dp[n]);
        }
        cout<<re<<endl;
    }
    // Check your array bounds!
    // Think about corner cases (smallest or biggest?)
}

Subtask #1
15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	376 KB	Output is correct
2	Correct	5 ms	376 KB	Output is correct
3	Correct	5 ms	376 KB	Output is correct
4	Correct	5 ms	376 KB	Output is correct
5	Correct	5 ms	400 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	376 KB	Output is correct
12	Correct	5 ms	376 KB	Output is correct
13	Correct	5 ms	376 KB	Output is correct
14	Correct	5 ms	376 KB	Output is correct
15	Correct	5 ms	376 KB	Output is correct
16	Correct	5 ms	396 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	504 KB	Output is correct
20	Correct	5 ms	504 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	6 ms	376 KB	Output is correct

Subtask #2
30.0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	376 KB	Output is correct
2	Correct	5 ms	376 KB	Output is correct
3	Correct	5 ms	376 KB	Output is correct
4	Correct	5 ms	376 KB	Output is correct
5	Correct	5 ms	400 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	376 KB	Output is correct
12	Correct	5 ms	376 KB	Output is correct
13	Correct	5 ms	376 KB	Output is correct
14	Correct	5 ms	376 KB	Output is correct
15	Correct	5 ms	376 KB	Output is correct
16	Correct	5 ms	396 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	504 KB	Output is correct
20	Correct	5 ms	504 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	6 ms	376 KB	Output is correct
27	Correct	48 ms	1352 KB	Output is correct
28	Correct	22 ms	1272 KB	Output is correct
29	Correct	45 ms	1272 KB	Output is correct
30	Correct	21 ms	1272 KB	Output is correct
31	Correct	64 ms	1384 KB	Output is correct
32	Correct	18 ms	1308 KB	Output is correct
33	Correct	42 ms	1272 KB	Output is correct
34	Correct	27 ms	1276 KB	Output is correct

Subtask #3
0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	376 KB	Output is correct
2	Correct	5 ms	376 KB	Output is correct
3	Correct	5 ms	376 KB	Output is correct
4	Correct	5 ms	376 KB	Output is correct
5	Correct	5 ms	400 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	376 KB	Output is correct
12	Correct	5 ms	376 KB	Output is correct
13	Correct	5 ms	376 KB	Output is correct
14	Correct	5 ms	376 KB	Output is correct
15	Correct	5 ms	376 KB	Output is correct
16	Correct	5 ms	396 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	504 KB	Output is correct
20	Correct	5 ms	504 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	6 ms	376 KB	Output is correct
27	Correct	48 ms	1352 KB	Output is correct
28	Correct	22 ms	1272 KB	Output is correct
29	Correct	45 ms	1272 KB	Output is correct
30	Correct	21 ms	1272 KB	Output is correct
31	Correct	64 ms	1384 KB	Output is correct
32	Correct	18 ms	1308 KB	Output is correct
33	Correct	42 ms	1272 KB	Output is correct
34	Correct	27 ms	1276 KB	Output is correct
35	Execution timed out	2553 ms	1528 KB	Time limit exceeded
36	Halted	0 ms	0 KB	-

Subtask #4
0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	376 KB	Output is correct
2	Correct	5 ms	376 KB	Output is correct
3	Correct	5 ms	376 KB	Output is correct
4	Correct	5 ms	376 KB	Output is correct
5	Correct	5 ms	400 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	376 KB	Output is correct
12	Correct	5 ms	376 KB	Output is correct
13	Correct	5 ms	376 KB	Output is correct
14	Correct	5 ms	376 KB	Output is correct
15	Correct	5 ms	376 KB	Output is correct
16	Correct	5 ms	396 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	504 KB	Output is correct
20	Correct	5 ms	504 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	6 ms	376 KB	Output is correct
27	Correct	48 ms	1352 KB	Output is correct
28	Correct	22 ms	1272 KB	Output is correct
29	Correct	45 ms	1272 KB	Output is correct
30	Correct	21 ms	1272 KB	Output is correct
31	Correct	64 ms	1384 KB	Output is correct
32	Correct	18 ms	1308 KB	Output is correct
33	Correct	42 ms	1272 KB	Output is correct
34	Correct	27 ms	1276 KB	Output is correct
35	Execution timed out	2553 ms	1528 KB	Time limit exceeded
36	Halted	0 ms	0 KB	-

Subtask #5
0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	376 KB	Output is correct
2	Correct	5 ms	376 KB	Output is correct
3	Correct	5 ms	376 KB	Output is correct
4	Correct	5 ms	376 KB	Output is correct
5	Correct	5 ms	400 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	376 KB	Output is correct
12	Correct	5 ms	376 KB	Output is correct
13	Correct	5 ms	376 KB	Output is correct
14	Correct	5 ms	376 KB	Output is correct
15	Correct	5 ms	376 KB	Output is correct
16	Correct	5 ms	396 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	504 KB	Output is correct
20	Correct	5 ms	504 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	6 ms	376 KB	Output is correct
27	Correct	48 ms	1352 KB	Output is correct
28	Correct	22 ms	1272 KB	Output is correct
29	Correct	45 ms	1272 KB	Output is correct
30	Correct	21 ms	1272 KB	Output is correct
31	Correct	64 ms	1384 KB	Output is correct
32	Correct	18 ms	1308 KB	Output is correct
33	Correct	42 ms	1272 KB	Output is correct
34	Correct	27 ms	1276 KB	Output is correct
35	Execution timed out	2553 ms	1528 KB	Time limit exceeded
36	Halted	0 ms	0 KB	-

답안 #200847

Compilation message

Subtask #1 15.0 / 15.0

Subtask #2 30.0 / 30.0

Subtask #3 0 / 10.0

Subtask #4 0 / 25.0

Subtask #5 0 / 20.0

Subtask #1
15.0 / 15.0

Subtask #2
30.0 / 30.0

Subtask #3
0 / 10.0

Subtask #4
0 / 25.0

Subtask #5
0 / 20.0