# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
415207 | ly20 | Paint By Numbers (IOI16_paint) | C++17 | 1 ms | 356 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 <bits/stdc++.h>
#include <cstdlib>
using namespace std;
const int MAXN = 110;
string resp;
pair <int, int> v[MAXN];
string solve_puzzle(string s, vector<int> c) {
resp.resize(s.size());
int n = s.size();
int k = c.size();
int at = 0;
for(int i = 0; i < n; i++) {
bool ok = true;
if(at == k) break;
for(int j = 0; j < c[at]; j++) {
if(s[j + i] == '_') ok = false;
}
if(ok) {
v[at].first = i;
i = i + c[at] ;
at++;
}
}
at = k - 1;
for(int i = n - 1; i >= 0; i--) {
bool ok = true;
if(at == -1) break;
for(int j = 0; j < c[at]; j++) {
if(s[i - j] == '_') ok = false;
# | 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... |