oj.uz

Submission #545209

# Submission time Handle Problem Language Result Execution time Memory
545209 2022-04-04T02:47:48 Z NhatMinh0208 Ili (COI17_ili) C++14
100 / 100
 560 ms 660 KB 
#ifndef CPL_TEMPLATE
#define CPL_TEMPLATE
/*
	Normie's Template v2.5
	Changes:
    Added warning against using pragmas on USACO.
*/
// Standard library in one include.
#include <bits/stdc++.h>
using namespace std;
 
// ordered_set library.
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set(el) tree<el,null_type,less<el>,rb_tree_tag,tree_order_statistics_node_update>
 
// AtCoder library. (Comment out these two lines if you're not submitting in AtCoder.) (Or if you want to use it in other judges, run expander.py first.)
//#include <atcoder/all>
//using namespace atcoder;

//Pragmas (Comment out these three lines if you're submitting in szkopul or USACO.)
// #pragma comment(linker, "/stack:200000000")
// #pragma GCC optimize("Ofast,unroll-loops,tree-vectorize")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
 
//File I/O.
#define FILE_IN "cseq.inp"
#define FILE_OUT "cseq.out"
#define ofile freopen(FILE_IN,"r",stdin);freopen(FILE_OUT,"w",stdout)
 
//Fast I/O.
#define fio ios::sync_with_stdio(0);cin.tie(0)
#define nfio cin.tie(0)
#define endl "\n"
 
//Order checking.
#define ord(a,b,c) ((a>=b)and(b>=c))
 
//min/max redefines, so i dont have to resolve annoying compile errors.
#define min(a,b) (((a)<(b))?(a):(b))
#define max(a,b) (((a)>(b))?(a):(b))

// Fast min/max assigns to use with AVX.
// Requires g++ 9.2.0.
template<typename T>
__attribute__((always_inline)) void chkmin(T& a, const T& b) {
    a=(a<b)?a:b;
}

template<typename T>
__attribute__((always_inline)) void chkmax(T& a, const T& b) {
    a=(a>b)?a:b;
}
 
//Constants.
#define MOD (ll(998244353))
#define MAX 300001
#define mag 320
const long double PI=3.14159265358979;
 
//Pairs and 3-pairs.
#define p1 first
#define p2 second.first
#define p3 second.second
#define fi first
#define se second
#define pii(element_type) pair<element_type,element_type>
#define piii(element_type) pair<element_type,pii(element_type)>
 
//Quick power of 2.
#define pow2(x) (ll(1)<<x)
 
//Short for-loops.
#define ff(i,__,___) for(int i=__;i<=___;i++)
#define rr(i,__,___) for(int i=__;i>=___;i--)
 
//Typedefs.
#define bi BigInt
typedef long long ll;
typedef long double ld;
typedef short sh;

// Binpow and stuff
ll BOW(ll a, ll x, ll p)
{
	if (!x) return 1;
	ll res=BOW(a,x/2,p);
	res*=res;
	res%=p;
	if (x%2) res*=a;
	return res%p;
}
ll INV(ll a, ll p)
{
	return BOW(a,p-2,p);
}
//---------END-------//
#endif
int nxt[20001][2];
int n,m,i,j,k,t,t1,u,v,a,b;
int arr[20001];
int tmp[20001];
void proc() {
	for (i=n+m;i>=n+1;i--) if (arr[i]==0) {
		arr[nxt[i][0]]=arr[nxt[i][1]]=0;
	}
	for (i=n+1;i<=n+m;i++) if (!(arr[nxt[i][0]]|arr[nxt[i][1]])) arr[i]=0;
}
int main()
{
	fio;
	cin>>n>>m;
	char c;
	for (i=1;i<=n;i++) arr[i]=-1;
	for (i=1;i<=m;i++) {
		cin>>c;
		if (c=='0') arr[n+i]=0;
		if (c=='1') arr[n+i]=1;
		if (c=='?') arr[n+i]=-1;
	}
	for (i=1;i<=m;i++) {
		cin>>c;
		if (c=='x') {
			cin>>u;
			nxt[n+i][0]=u;
		}
		else {
			cin>>u;
			nxt[n+i][0]=n+u;
		}
		cin>>c;
		if (c=='x') {
			cin>>u;
			nxt[n+i][1]=u;
		}
		else {
			cin>>u;
			nxt[n+i][1]=n+u;
		}
	}
	proc();
	for (i=1;i<=n+m;i++) tmp[i]=arr[i];
	for (t=n+1;t<=n+m;t++) if (tmp[t]==-1) {
		for (i=1;i<=n+m;i++) arr[i]=tmp[i];
		arr[t]=0;
		proc();
		for (i=1;i<=n+m;i++) if (tmp[i]==1 && arr[i]==0) break;
		if (i<=n+m) tmp[t]=1;
	}
	for (i=n+1;i<=n+m;i++) {
		if (tmp[i]==1) cout<<'1';
		if (tmp[i]==0) cout<<'0';
		if (tmp[i]==-1) cout<<'?';
	}
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 340 KB Output is correct

Subtask #2
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 328 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 2 ms 340 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 2 ms 340 KB Output is correct

Subtask #3
51.0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 328 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 2 ms 340 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 2 ms 340 KB Output is correct
15 Correct 120 ms 492 KB Output is correct
16 Correct 263 ms 468 KB Output is correct
17 Correct 369 ms 556 KB Output is correct
18 Correct 375 ms 616 KB Output is correct
19 Correct 242 ms 544 KB Output is correct
20 Correct 560 ms 644 KB Output is correct
21 Correct 434 ms 660 KB Output is correct
22 Correct 168 ms 652 KB Output is correct
23 Correct 184 ms 648 KB Output is correct
24 Correct 188 ms 652 KB Output is correct
25 Correct 186 ms 588 KB Output is correct
26 Correct 165 ms 596 KB Output is correct
27 Correct 176 ms 648 KB Output is correct
28 Correct 163 ms 640 KB Output is correct
29 Correct 167 ms 640 KB Output is correct
30 Correct 164 ms 644 KB Output is correct
31 Correct 177 ms 600 KB Output is correct
32 Correct 211 ms 596 KB Output is correct