# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1194915 | Mousa_Aboubaker | Paint By Numbers (IOI16_paint) | C++20 | 194 ms | 424 KiB |
#include "paint.h"
#include <bits/stdc++.h>
using namespace std;
string solve_puzzle(string s, vector<int> c)
{
// let's try to generate each valid one for each c_i
// let's solve the second subtask for now
vector<string> x;
int n = s.size();
for(int i = 0; i < (1 << n); i++)
{
string y;
for(int j = 0; j < n; j++)
y.push_back(((i >> j) & 1) ? 'X' : '_');
vector<int> d;
for(int j = 0; j < n; j++)
{
if(y[j] == '_')
continue;
int k = j;
while(k < n and y[k] == y[j])
k++;
d.push_back(k - j);
j = k - 1;
}
if(d == c)
x.push_back(y);
}
string res = x[0];
for(auto i: x)
{
for(int j = 0; j < n; j++)
{
if(res[j] == '?')
continue;
if(res[j] != i[j])
res[j] = '?';
}
}
return res;
}
컴파일 시 표준 에러 (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... |