oj.uz

답안 #57929

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
57929 2018-07-16T14:07:11 Z Benq Ili (COI17_ili) C++14
100 / 100
 588 ms 22132 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
 
using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
 
typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;
 
typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;
 
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;
 
#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)
 
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
 
const int MOD = 1000000007;
const ll INF = 1e18;
const int MX = 10001;
 
int n,m, status[MX];
pi pre[MX];
bitset<MX> res[2*MX], posi;
bitset<2*MX> cur;
 
int clas(string a) {
    int x = stoi(a.substr(1,sz(a)-1));
    if (a[0] == 'x') return x+m;
    return x;
}

bool check(int x) {
    auto POSI = posi^res[x];
    FOR(i,1,n+1) cur[i+m] = POSI[i];
    FOR(i,1,m+1) {
        cur[i] = cur[pre[i].f]|cur[pre[i].s];
        if (cur[i] == 0 && status[i] == 1) return 1;
    }
    return 0;
}
 
void input() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> n >> m;
    FOR(i,1,n+1) res[m+i][i] = 1;
    FOR(i,1,m+1) {
        char c; cin >> c;
        if ('0' <= c && c <= '1') status[i] = c-'0';
        else status[i] = -1;
    }
}
int main() {
    input();
    FOR(i,1,m+1) {
        string a,b; cin >> a >> b;
        int A = clas(a), B = clas(b);
        res[i] = res[A]|res[B];
        pre[i] = {A,B};
        if (status[i] == 0) posi |= res[i];
    }
    posi.flip();
    FOR(i,1,m+1) res[i] &= posi;
    FOR(i,1,m+1) if (status[i] == -1) {
    	if (res[i].count() == 0) {
    		status[i] = 0;
    		continue;
    	}
    	if (check(i)) status[i] = 1;
    }
    FOR(i,1,m+1) {
    	if (status[i] == -1) cout << "?";
    	else cout << status[i];
    }
}
 
/* Look for:
* the exact constraints (multiple sets are too slow for n=10^6 :( ) 
* special cases (n=1?)
* overflow (ll vs int?)
* array bounds
*/

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 3 ms 520 KB Output is correct
4 Correct 2 ms 520 KB Output is correct
5 Correct 2 ms 544 KB Output is correct
6 Correct 2 ms 544 KB Output is correct
7 Correct 2 ms 608 KB Output is correct

Subtask #2
42.0 / 42.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 3 ms 520 KB Output is correct
4 Correct 2 ms 520 KB Output is correct
5 Correct 2 ms 544 KB Output is correct
6 Correct 2 ms 544 KB Output is correct
7 Correct 2 ms 608 KB Output is correct
8 Correct 5 ms 1312 KB Output is correct
9 Correct 4 ms 1312 KB Output is correct
10 Correct 5 ms 1488 KB Output is correct
11 Correct 4 ms 1488 KB Output is correct
12 Correct 4 ms 1488 KB Output is correct
13 Correct 5 ms 1488 KB Output is correct
14 Correct 5 ms 1488 KB Output is correct

Subtask #3
51.0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 3 ms 520 KB Output is correct
4 Correct 2 ms 520 KB Output is correct
5 Correct 2 ms 544 KB Output is correct
6 Correct 2 ms 544 KB Output is correct
7 Correct 2 ms 608 KB Output is correct
8 Correct 5 ms 1312 KB Output is correct
9 Correct 4 ms 1312 KB Output is correct
10 Correct 5 ms 1488 KB Output is correct
11 Correct 4 ms 1488 KB Output is correct
12 Correct 4 ms 1488 KB Output is correct
13 Correct 5 ms 1488 KB Output is correct
14 Correct 5 ms 1488 KB Output is correct
15 Correct 33 ms 8676 KB Output is correct
16 Correct 188 ms 11120 KB Output is correct
17 Correct 151 ms 12020 KB Output is correct
18 Correct 352 ms 14952 KB Output is correct
19 Correct 198 ms 14952 KB Output is correct
20 Correct 467 ms 19172 KB Output is correct
21 Correct 438 ms 22132 KB Output is correct
22 Correct 202 ms 22132 KB Output is correct
23 Correct 217 ms 22132 KB Output is correct
24 Correct 214 ms 22132 KB Output is correct
25 Correct 588 ms 22132 KB Output is correct
26 Correct 365 ms 22132 KB Output is correct
27 Correct 386 ms 22132 KB Output is correct
28 Correct 390 ms 22132 KB Output is correct
29 Correct 358 ms 22132 KB Output is correct
30 Correct 488 ms 22132 KB Output is correct
31 Correct 374 ms 22132 KB Output is correct
32 Correct 353 ms 22132 KB Output is correct