oj.uz

Submission #57894

# Submission time Handle Problem Language Result Execution time Memory
57894 2018-07-16T13:40:12 Z Benq Ili (COI17_ili) C++14
49 / 100
 4000 ms 44472 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];
bitset<MX> res[MX], posi, bad[MX];
vi z;
vi toCheck[MX];
 
bitset<MX> clas(string a, int t) {
    int x = stoi(a.substr(1,sz(a)-1));
    if (a[0] == 'x') {
        bitset<MX> z;
        z[x] = 1;
        return z;
    }
	if (bad[x] == 1) bad[t] = 1;
    return res[x];
}
 
bool check(int x) {
	for (int i: z) {
		bool ok = 1;
		for (int b: toCheck[i]) {
			if (!res[x][b]) {
				ok = 0;
				break;
			}
		}
		if (ok) return 1;
	}
	return 0;
}
 
int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> n >> m;
    FOR(i,1,m+1) {
        char c; cin >> c;
        if ('0' <= c && c <= '1') status[i] = c-'0';
        else status[i] = -1;
    }
    FOR(i,1,m+1) {
        string a,b; cin >> a >> b;
        res[i] = clas(a,i)|clas(b,i);
        if (status[i] == 0) posi |= res[i];
        if (status[i] == 1) {
        	if (bad[i] == 0) z.pb(i);
        	bad[i] = 1;
        }
    }
    posi.flip();
    FOR(i,1,m+1) res[i] &= posi;
    for (int i: z) {
    	FOR(j,1,n+1) if (res[i][j]) toCheck[i].pb(j);
    }
    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

# Verdict Execution time Memory Grader output
1 Correct 2 ms 632 KB Output is correct
2 Correct 3 ms 744 KB Output is correct
3 Correct 3 ms 744 KB Output is correct
4 Correct 3 ms 752 KB Output is correct
5 Correct 3 ms 784 KB Output is correct
6 Correct 3 ms 864 KB Output is correct
7 Correct 3 ms 868 KB Output is correct

Subtask #2
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 632 KB Output is correct
2 Correct 3 ms 744 KB Output is correct
3 Correct 3 ms 744 KB Output is correct
4 Correct 3 ms 752 KB Output is correct
5 Correct 3 ms 784 KB Output is correct
6 Correct 3 ms 864 KB Output is correct
7 Correct 3 ms 868 KB Output is correct
8 Correct 6 ms 2024 KB Output is correct
9 Correct 5 ms 2024 KB Output is correct
10 Correct 4 ms 2024 KB Output is correct
11 Correct 5 ms 2024 KB Output is correct
12 Correct 5 ms 2024 KB Output is correct
13 Correct 5 ms 2024 KB Output is correct
14 Correct 5 ms 2064 KB Output is correct

Subtask #3
0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 632 KB Output is correct
2 Correct 3 ms 744 KB Output is correct
3 Correct 3 ms 744 KB Output is correct
4 Correct 3 ms 752 KB Output is correct
5 Correct 3 ms 784 KB Output is correct
6 Correct 3 ms 864 KB Output is correct
7 Correct 3 ms 868 KB Output is correct
8 Correct 6 ms 2024 KB Output is correct
9 Correct 5 ms 2024 KB Output is correct
10 Correct 4 ms 2024 KB Output is correct
11 Correct 5 ms 2024 KB Output is correct
12 Correct 5 ms 2024 KB Output is correct
13 Correct 5 ms 2024 KB Output is correct
14 Correct 5 ms 2064 KB Output is correct
15 Correct 36 ms 15672 KB Output is correct
16 Correct 40 ms 15716 KB Output is correct
17 Correct 44 ms 19528 KB Output is correct
18 Correct 66 ms 23840 KB Output is correct
19 Correct 41 ms 23840 KB Output is correct
20 Correct 83 ms 23840 KB Output is correct
21 Correct 94 ms 24504 KB Output is correct
22 Correct 108 ms 25404 KB Output is correct
23 Correct 88 ms 26284 KB Output is correct
24 Correct 84 ms 26408 KB Output is correct
25 Correct 204 ms 26584 KB Output is correct
26 Correct 235 ms 26584 KB Output is correct
27 Correct 224 ms 26784 KB Output is correct
28 Correct 241 ms 26784 KB Output is correct
29 Correct 204 ms 26784 KB Output is correct
30 Correct 228 ms 26784 KB Output is correct
31 Execution timed out 4019 ms 44472 KB Time limit exceeded
32 Halted 0 ms 0 KB -