제출 #562762

#제출 시각아이디문제언어결과실행 시간메모리
562762elazarkorenPaint By Numbers (IOI16_paint)C++17
7 / 100
1 ms312 KiB
#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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...