oj.uz

답안 #57888

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
57888 2018-07-16T13:31:44 Z Benq Ili (COI17_ili) C++14
49 / 100
 4000 ms 32916 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], bad[MX];
bitset<MX> res[MX], posi;
vi z;
vector<vi> toCheck;

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]) bad[t] = 1;
    return res[x];
}

bool check(int x) {
	for (auto& a: toCheck) {
		bool ok = 1;
		for (auto b: a) {
			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]) z.pb(i);
        	bad[i] = 1;
        }
    }
    posi.flip();
    FOR(i,1,m+1) res[i] &= posi;
    for (int i: z) {
    	vi v;
    	FOR(j,1,n+1) if (res[i][j]) v.pb(j);
    	toCheck.pb(v);
    	/*for (int i: v) cout << i << " ";
    	cout << "|\n";*/
    }
    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 2 ms 376 KB Output is correct
2 Correct 2 ms 496 KB Output is correct
3 Correct 2 ms 496 KB Output is correct
4 Correct 2 ms 496 KB Output is correct
5 Correct 2 ms 496 KB Output is correct
6 Correct 2 ms 496 KB Output is correct
7 Correct 2 ms 572 KB Output is correct

Subtask #2
42.0 / 42.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 496 KB Output is correct
3 Correct 2 ms 496 KB Output is correct
4 Correct 2 ms 496 KB Output is correct
5 Correct 2 ms 496 KB Output is correct
6 Correct 2 ms 496 KB Output is correct
7 Correct 2 ms 572 KB Output is correct
8 Correct 3 ms 1052 KB Output is correct
9 Correct 3 ms 1052 KB Output is correct
10 Correct 3 ms 1064 KB Output is correct
11 Correct 4 ms 1328 KB Output is correct
12 Correct 4 ms 1328 KB Output is correct
13 Correct 3 ms 1328 KB Output is correct
14 Correct 3 ms 1412 KB Output is correct

Subtask #3
0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 496 KB Output is correct
3 Correct 2 ms 496 KB Output is correct
4 Correct 2 ms 496 KB Output is correct
5 Correct 2 ms 496 KB Output is correct
6 Correct 2 ms 496 KB Output is correct
7 Correct 2 ms 572 KB Output is correct
8 Correct 3 ms 1052 KB Output is correct
9 Correct 3 ms 1052 KB Output is correct
10 Correct 3 ms 1064 KB Output is correct
11 Correct 4 ms 1328 KB Output is correct
12 Correct 4 ms 1328 KB Output is correct
13 Correct 3 ms 1328 KB Output is correct
14 Correct 3 ms 1412 KB Output is correct
15 Correct 24 ms 8220 KB Output is correct
16 Correct 25 ms 9572 KB Output is correct
17 Correct 26 ms 11464 KB Output is correct
18 Correct 40 ms 13520 KB Output is correct
19 Correct 26 ms 13520 KB Output is correct
20 Correct 67 ms 13600 KB Output is correct
21 Correct 83 ms 13992 KB Output is correct
22 Correct 58 ms 13992 KB Output is correct
23 Correct 87 ms 13992 KB Output is correct
24 Correct 57 ms 14108 KB Output is correct
25 Correct 156 ms 14952 KB Output is correct
26 Correct 154 ms 14952 KB Output is correct
27 Correct 155 ms 14952 KB Output is correct
28 Correct 142 ms 14952 KB Output is correct
29 Correct 147 ms 14952 KB Output is correct
30 Correct 151 ms 15000 KB Output is correct
31 Execution timed out 4014 ms 32916 KB Time limit exceeded
32 Halted 0 ms 0 KB -