# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
137322 | mirbek01 | Paint By Numbers (IOI16_paint) | C++11 | 2 ms | 376 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "paint.h"
//#include "grader.cpp"
#include <cstdlib>
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 3;
int pf[3][N], n, m;
int dp[202][N], pref[N], f[202][N], pfX[N], sfX[N];
int get(int l, int r, int tp){
if(l > r) return 0;
return pf[tp][r] - pf[tp][l - 1];
}
int Get(int l, int r, int tp){
if(l > r) return 0;
return f[tp][r] - f[tp][l - 1];
}
string solve_puzzle(string s, vector<int> c) {
n = (int)s.size();
m = (int)c.size();
s = ' ' + s;
for(int i = 1; i <= n; i ++){
if(s[i] == 'X')
pf[0][i] ++, pfX[i] = i;
if(s[i] == '_')
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |