Submission #917309

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
917309	2024-01-27 17:42:41	velislavgarkov	Paint By Numbers (IOI16_paint)	C++14	100 / 100	268 ms	132372 KiB

paint

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include "paint.h"
#include <iostream>
#include <vector>
using namespace std;
const int MAXN=2e5+10;
const int MAXK=1e2+10;
string s;
int c[MAXK];
int lef[MAXN], ri[MAXN], pr[MAXN][MAXK];
bool ok[2][MAXN][MAXK];
int n, k;
int get_gr(int ind, int i) {
    if (ind==0) return lef[i];
    return n-ri[n-i+1]+1;
}
void find_dp(int ind) {
    int cur;
    ok[ind][0][0]=true;
    for (int i=1;i<=n+1;i++) {
        if (s[i]=='X') ok[ind][i][0]=false;
        else ok[ind][i][0]=ok[ind][i-1][0];
        for (int j=1;j<=k;j++) {
            ok[ind][i][j]=false;
            if (s[i]=='X') continue;
            ok[ind][i][j]=ok[ind][i-1][j];
            if (i-c[j]-1<0) continue;
            cur=get_gr(ind,i-1);
            if (cur<=i-c[j]-1) {
                if (ok[ind][i-c[j]-1][j-1]) {
                    ok[ind][i][j]=true;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 7 / 7
• Subtask 2: 3 / 3
• Subtask 3: 22 / 22
• Subtask 4: 27 / 27
• Subtask 5: 21 / 21
• Subtask 6: 10 / 10
• Subtask 7: 10 / 10