이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include "paint.h"
#include <bits/stdc++.h>
#define x first
#define y second
#define all(v) v.begin(), v.end()
#define chkmin(a, b) a = min(a, b)
#define chkmax(a, b) a = max(a, b)
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
typedef vector<pii> vii;
const int MAX_N = 2e5 + 5;
int cnt[MAX_N];
std::string solve_puzzle(std::string s, std::vector<int> c) {
int n = s.size();
int ind = 0;
for (int d : c) {
for (int i = ind; i < ind + d; i++) cnt[i]++;
ind += d + 1;
}
reverse(all(c));
ind = n - 1;
for (int d : c) {
for (int i = ind; i > ind - d; i--) cnt[i]++;
ind -= d + 1;
}
string ans(n, '?');
for (int i = 0; i < n; i++) {
ans[i] = cnt[i] == 2 ? 'X' : '?';
}
return ans;
}
# | 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... |