oj.uz

Submission #307778

# Submission time Handle Problem Language Result Execution time Memory
307778 2020-09-29T09:57:20 Z b00n0rp Handcrafted Gift (IOI20_gift) C++17
100 / 100
 223 ms 24980 KB 
#include "gift.h"
#include<bits/stdc++.h>
using namespace std;
 
#define REP(i,n) for(int i = 0; i < n; i ++)
#define FOR(i,a,b) for(int i = a; i < b; i ++)
#define FORD(i,a,b) for(int i = a; i >= b; i --)
 
#define vi vector<int>
#define remin(a,b) a = min(a,b)
#define remax(a,b) a = max(a,b)
 
const int MX = 500005;
 
int lft[MX][3];
int dp[MX];
int pref[MX];
int breakable[MX];
 
int construct(int n, int r, vi a, vi b, vi x) {
    REP(i,n+1){
    	lft[i][1] = i;
    	lft[i][2] = 0;
    }
    REP(i,r){
    	a[i]++;
    	b[i]++;
    	if(x[i] == 1){
    		remin(lft[b[i]][1],a[i]);
    		pref[a[i]]++;
    		pref[b[i]]--;
    	}
    	else remax(lft[b[i]][2],a[i]);
    }
    FOR(i,2,n+1) pref[i] += pref[i-1];
    REP(i,n+1) breakable[i] = (pref[i] == 0);
 
    FORD(i,n-1,1){
    	remin(lft[i][1],lft[i+1][1]);
    }
    FOR(i,2,n+1){
    	remax(lft[i][2],lft[i-1][2]);
    }
    dp[0] = 0;
    int last = 0;
    FOR(i,1,n+1){
    	dp[i] = -1;
    	if(last >= lft[i][2]){
    		dp[i] = last;
    		if(breakable[i]) last = i;
    	}
    }
    if(dp[n] == -1) return 0;
    string s = "";
    REP(i,n) s += 'R';
    int cur = 0;
    int ind = n;
    while(ind){
    	if(cur){
	    	FOR(i,dp[ind],ind) s[i] = 'B';
    	}
    	cur = 1-cur;
    	ind = dp[ind];
    }
    craft(s);
    return 1;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 4 ms 768 KB Output is correct
5 Correct 194 ms 24972 KB Output is correct
6 Correct 196 ms 24980 KB Output is correct
7 Correct 213 ms 24880 KB Output is correct
8 Correct 220 ms 24880 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 4 ms 896 KB Output is correct
4 Correct 209 ms 24880 KB Output is correct
5 Correct 206 ms 24880 KB Output is correct
6 Correct 198 ms 23800 KB Output is correct
7 Correct 197 ms 23800 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 4 ms 768 KB Output is correct
5 Correct 194 ms 24972 KB Output is correct
6 Correct 196 ms 24980 KB Output is correct
7 Correct 213 ms 24880 KB Output is correct
8 Correct 220 ms 24880 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 4 ms 896 KB Output is correct
12 Correct 209 ms 24880 KB Output is correct
13 Correct 206 ms 24880 KB Output is correct
14 Correct 198 ms 23800 KB Output is correct
15 Correct 197 ms 23800 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 0 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 0 ms 384 KB Output is correct
22 Correct 0 ms 384 KB Output is correct
23 Correct 0 ms 384 KB Output is correct
24 Correct 0 ms 384 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 0 ms 384 KB Output is correct
27 Correct 0 ms 384 KB Output is correct
28 Correct 0 ms 384 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 1 ms 384 KB Output is correct
34 Correct 1 ms 384 KB Output is correct
35 Correct 24 ms 13216 KB Output is correct
36 Correct 21 ms 13264 KB Output is correct
37 Correct 29 ms 13640 KB Output is correct
38 Correct 210 ms 24980 KB Output is correct
39 Correct 206 ms 23800 KB Output is correct
40 Correct 220 ms 24880 KB Output is correct
41 Correct 223 ms 24880 KB Output is correct
42 Correct 222 ms 24880 KB Output is correct