# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
276034 | brcode | Paint By Numbers (IOI16_paint) | C++14 | 1 ms | 384 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 <iostream>
#include <bits/stdc++.h>
#include "paint.h"
using namespace std;
const int MAXN = 5010;
vector<vector<int>> res;
vector<int> c;
int pref2[MAXN];
int pref[MAXN];
bool dp[MAXN][250];
int l[250];
int r[250];
bool zero[250];
string solve_puzzle(string s,vector<int> v1){
int k = v1.size();
int n = s.length();
s = '#'+s;
int pos1 = 0;
int pos2 = n;
for(int i=1;i<=n;i++){
pref[i] = pref[i-1]+(s[i] == '_');
pref2[i] = pref2[i-1]+(s[i]=='X');
if(pref2[i] == 1 && pos1 ==0){
pos1 = i;
}
}
for(int i=n-1;i>=1;i--){
if(pref2[i]!=pref2[i+1]){
pos2 = i+1;
Compilation message (stderr)
# | 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... |