이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/trie_policy.hpp>
// #include <ext/rope>
using namespace std;
// using namespace __gnu_cxx;
// using namespace __gnu_pbds;
void Hollwo_Pelw();
signed main(){
#ifndef hollwo_pelw_local
if (fopen("A.inp", "r"))
assert(freopen("A.inp", "r", stdin)), assert(freopen("A.out", "w", stdout));
#else
auto start = chrono::steady_clock::now();
#endif
cin.tie(0), cout.tie(0) -> sync_with_stdio(0);
int testcases = 1;
// cin >> testcases;
for (int test = 1; test <= testcases; test++){
// cout << "Case #" << test << ": ";
Hollwo_Pelw();
}
#ifdef hollwo_pelw_local
auto end = chrono::steady_clock::now();
cout << "\nExcution time : " << chrono::duration_cast<chrono::milliseconds> (end - start).count() << "[ms]" << endl;
#endif
}
const int N = 2e4 + 5;
int n, m, prv[N][2];
char c[N];
inline int read() {
string s; cin >> s;
int t = s[0] == 'x' ? 0 : 1, v = 0;
s = s.substr(1);
stringstream ss;
ss << s; ss >> v;
return v + t * n;
}
inline char _or(char a, char b) {
if (a == '1' || b == '1') return '1';
if (a == '0' && b == '0') return '0';
return '?';
}
void Hollwo_Pelw(){
cin >> n >> m;
for (int i = 1; i <= n; i++)
c[i] = '?';
for (int i = n + 1; i <= n + m; i++)
cin >> c[i];
for (int i = n + 1; i <= n + m; i++) {
int a = read(), b = read();
prv[i][0] = a;
prv[i][1] = b;
}
bitset<N> a, b;
for (int i = 1; i <= n + m; i++)
a.set(i, c[i] == '0' ? 0 : 1);
for (int i = n + m; i > n; i--)
if (!a[i]) a[prv[i][0]] = a[prv[i][1]] = 0;
for (int i = n + 1; i <= n + m; i++)
a[i] = a[prv[i][0]] | a[prv[i][1]];
for (int i = n + 1; i <= n + m; i++)
if (c[i] == '?' && a[i]) {
b = a, b.set(i, 0);
for (int j = i; j > n; j--)
if (!b[j]) b[prv[j][0]] = b[prv[j][1]] = 0;
for (int j = n + 1; j <= n + m; j++)
b[j] = b[prv[j][0]] | b[prv[j][1]];
for (int j = n + 1; j <= n + m; j++)
if (c[j] == '1' && !b[j]) c[i] = '1';
}
for (int i = n + 1; i <= n + m; i++)
cout << c[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... |