oj.uz

Submission #448564

# Submission time Handle Problem Language Result Execution time Memory
448564 2021-07-30T17:45:02 Z Khizri KOVANICE (COI15_kovanice) C++17
0 / 100
 2000 ms 26324 KB 
#include <bits/stdc++.h>
using namespace std;
//------------------------------DEFINE------------------------------
//******************************************************************
#define IOS ios_base::sync_with_stdio(false); cin.tie(0),cout.tie(0)
#define ll long long
#define pb push_back		 
#define F first																 
#define S second 															 
#define INF 1e18
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define pii pair<int,int>
#define pll pair<ll,ll>
#define OK cout<<"Ok"<<endl;
#define MOD (ll)(1e9+7)
#define endl "\n"
//******************************************************************
//----------------------------FUNCTION------------------------------
//******************************************************************
ll gcd(ll a,ll b){
	if(a>b) swap(a,b);
	if(a==0) return a+b;
	return gcd(b%a,a);
}
ll lcm(ll a,ll b){
	return a/gcd(a,b)*b;
}
bool is_prime(ll n){
	ll k=sqrt(n);
	if(n==2) return true;
	if(n<2||n%2==0||k*k==n) return false;
	for(int i=3;i<=k;i+=2){
		if(n%i==0){
			return false;
		}
	}
	return true;
}
//*****************************************************************
//--------------------------MAIN-CODE------------------------------
const int mxn=3e5+5;
int t=1,n,m,q,arr[mxn],l,r,color[mxn],color2[mxn],cl,d[mxn],k,maxs,root;
char cc;
vector<int>vtc[mxn];
vector<int>vt[mxn];
void dfs(int u,int lev){
	k=max(k,lev);
	color[u]=cl;
	for(int v:vt[u]){
		if(color[v]!=cl){
			dfs(v,lev+1);
		}
	}
}
void paint(int u,int val){
	arr[u]=val;
	color2[u]=1;
	for(int v:vtc[u]){
		if(!color2[v]){
			paint(v,val);
		}
	}
}
void dfss(int u,int lev){
	paint(u,lev);
	color[u]=cl;
	for(int v:vt[u]){
		if(color[v]!=cl){
			dfss(v,lev+1);
		}
	}
}
void dfs2(int u){
	color[u]=cl;
	for(int v:vt[u]){
		if(color[v]!=cl){
			dfs2(v);
			paint(u,arr[v]-1);
		}
		else{
			paint(u,arr[v]-1);
		}
	}
}
void solve(){
	cin>>n>>m>>q;
	vector<pii>a,b;
	while(q--){
		cin>>l>>cc>>r;
		if(cc=='<'){
			vt[l].pb(r);
			d[r]++;
		}
		else if(cc=='>'){
			vt[r].pb(l);
			d[l]++;
		}
		else{
			vtc[l].pb(r);
			vtc[r].pb(l);
		}
	}
	for(int i=1;i<=m;i++){
		if(d[i]==0&&arr[i]==0){
			cl++;
			k=0;
			dfs(i,1);
			if(k==n){
				cl++;
				dfss(i,1);
			}
		}
	}
	for(int i=1;i<=m;i++){
		if(arr[i]==0){
			cout<<"?"<<endl;
		}
		else{
			cout<<"K"<<arr[i]<<endl;
		}
	}
}
int main(){
	IOS;
	//cin>>t;
	while(t--){
		solve();
	}
	return 0;
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 9 ms 14412 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 40.0

# Verdict Execution time Memory Grader output
1 Incorrect 112 ms 21544 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 29 ms 15120 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2091 ms 26324 KB Time limit exceeded
2 Halted 0 ms 0 KB -