Submission #545209

#	Time	Username	Problem	Language	Result	Execution time	Memory
545209		NhatMinh0208	Ili (COI17_ili)	C++14	100 / 100	560 ms	660 KiB

ili

#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 / 7
• Subtask 2: 42 / 42
• Subtask 3: 51 / 51