# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
479472 | ponytail | Paint By Numbers (IOI16_paint) | C++17 | 0 ms | 204 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 <vector>
#include <string>
#include <cstdio>
#include <cstdlib>
#include <cassert>
#include <bits/stdc++.h>
using namespace std;
std::string solve_puzzle(std::string s, std::vector<int> c) {
int k = c.size();
int n = s.size();
int ps[2][n]; // X _
ps[0][0] = (s[0] == 'X');
ps[1][0] = (s[0] == '_');
for(int i=1; i<n; i++) {
ps[0][i] = ps[0][i-1] + (s[i] == 'X');
ps[1][i] = ps[1][i-1] + (s[i] == '_');
}
int can[2][n]; // X _
for(int i=0; i<2; i++) {
for(int j=0; j<n; j++) {
can[i][j] = 0;
}
}
int mx[n];
int prv = 0;
for(int i=0; i<n; 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... |