oj.uz

Submission #466120

# Submission time Handle Problem Language Result Execution time Memory
466120 2021-08-18T02:03:26 Z SirCovidThe19th Ili (COI17_ili) C++17
100 / 100
 616 ms 1352 KB 
#include <bits/stdc++.h>
using namespace std; 
 
int n, m; vector<char> A; vector<int> in[20005];
 
void set0(vector<char> &X, int i){
    X[i] = '0'; 
    for (auto nxt : in[i]) if (X[nxt] != '0') set0(X, nxt);
}
 
int main(){
    cin >> n >> m; A.resize(n + m);
    for (int i = 0; i < n + m; i++){
        if (i < n) A[i] = '?';
        else cin >> A[i];
    }
    for (int i = n, u, v; i < n + m; i++){
        string a, b; cin >> a >> b;
        u = stoi(a.substr(1)) + (a[0] == 'c' ? n : 0);
        v = stoi(b.substr(1)) + (b[0] == 'c' ? n : 0);
        in[i].push_back(u - 1); in[i].push_back(v - 1);
    }
    for (int i = n; i < n + m; i++) if (A[i] == '0') set0(A, i);
    for (int i = n; i < n + m; i++) if (A[in[i][0]] == '0' and A[in[i][1]] == '0') A[i] = '0';
    
    for (int i = n; i < n + m; i++){
        if (A[i] == '?'){
            bool ok0 = 1; vector<char> tmp = A; set0(tmp, i);
            for (int j = n; j < n + m and ok0; j++){
                char &in1 = tmp[in[j][0]], &in2 = tmp[in[j][1]], &cur = tmp[j];
                if (in1 == '0' and in2 == '0') cur = '0';
                else if (in1 == '1' or in2 == '1') cur = '1';
                if (j == i and cur == '1') ok0 = 0;
                if (A[j] != '?' and cur != A[j]) ok0 = 0;
            }
            cout<<(ok0 ? "?" : "1");
        }
        else cout<<A[i];
    }
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 716 KB Output is correct
2 Correct 1 ms 716 KB Output is correct
3 Correct 1 ms 716 KB Output is correct
4 Correct 1 ms 716 KB Output is correct
5 Correct 1 ms 716 KB Output is correct
6 Correct 1 ms 768 KB Output is correct
7 Correct 1 ms 716 KB Output is correct

Subtask #2
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 716 KB Output is correct
2 Correct 1 ms 716 KB Output is correct
3 Correct 1 ms 716 KB Output is correct
4 Correct 1 ms 716 KB Output is correct
5 Correct 1 ms 716 KB Output is correct
6 Correct 1 ms 768 KB Output is correct
7 Correct 1 ms 716 KB Output is correct
8 Correct 2 ms 716 KB Output is correct
9 Correct 2 ms 716 KB Output is correct
10 Correct 2 ms 716 KB Output is correct
11 Correct 2 ms 716 KB Output is correct
12 Correct 1 ms 716 KB Output is correct
13 Correct 1 ms 716 KB Output is correct
14 Correct 2 ms 716 KB Output is correct

Subtask #3
51.0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 716 KB Output is correct
2 Correct 1 ms 716 KB Output is correct
3 Correct 1 ms 716 KB Output is correct
4 Correct 1 ms 716 KB Output is correct
5 Correct 1 ms 716 KB Output is correct
6 Correct 1 ms 768 KB Output is correct
7 Correct 1 ms 716 KB Output is correct
8 Correct 2 ms 716 KB Output is correct
9 Correct 2 ms 716 KB Output is correct
10 Correct 2 ms 716 KB Output is correct
11 Correct 2 ms 716 KB Output is correct
12 Correct 1 ms 716 KB Output is correct
13 Correct 1 ms 716 KB Output is correct
14 Correct 2 ms 716 KB Output is correct
15 Correct 24 ms 988 KB Output is correct
16 Correct 257 ms 1072 KB Output is correct
17 Correct 174 ms 1220 KB Output is correct
18 Correct 543 ms 1220 KB Output is correct
19 Correct 182 ms 1096 KB Output is correct
20 Correct 577 ms 1300 KB Output is correct
21 Correct 616 ms 1228 KB Output is correct
22 Correct 267 ms 1204 KB Output is correct
23 Correct 271 ms 1352 KB Output is correct
24 Correct 304 ms 1216 KB Output is correct
25 Correct 202 ms 1220 KB Output is correct
26 Correct 199 ms 1220 KB Output is correct
27 Correct 201 ms 1208 KB Output is correct
28 Correct 196 ms 1200 KB Output is correct
29 Correct 208 ms 1216 KB Output is correct
30 Correct 205 ms 1336 KB Output is correct
31 Correct 302 ms 1184 KB Output is correct
32 Correct 374 ms 1212 KB Output is correct