oj.uz

답안 #448432

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
448432 2021-07-30T07:21:10 Z Khizri KOVANICE (COI15_kovanice) C++17
0 / 100
 346 ms 16588 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],cl;
char cc;
vector<int>vt[mxn];
void dfs(int u,int val){
	color[u]=cl;
	arr[u]=val;
	for(int v:vt[u]){
		if(color[v]!=cl){
			dfs(v,val);
		}
	}
}
void solve(){
	cin>>n>>m>>q;
	vector<pii>a,b;
	while(q--){
		scanf("%d",&l);
		scanf(" %c",&cc);
		scanf("%d",&r);
		if(cc=='<'){
			a.pb({l,r});
		}
		else if(cc=='>'){
			b.pb({l,r});
		}
		else{
			vt[l].pb(r);
			vt[r].pb(l);
		}
	}
	for(int i=0;i<a.size();i++){
		int u=a[i].F,v=a[i].S;
		cl++;
		dfs(u,1);
		cl++;
		dfs(v,2);
	}
	for(int i=0;i<b.size();i++){
		int u=b[i].F,v=b[i].S;
		cl++;
		dfs(u,2);
		cl++;
		dfs(v,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;
}

Compilation message

kovanice.cpp: In function 'void solve()':
kovanice.cpp:73:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   73 |  for(int i=0;i<a.size();i++){
      |              ~^~~~~~~~~
kovanice.cpp:80:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   80 |  for(int i=0;i<b.size();i++){
      |              ~^~~~~~~~~
kovanice.cpp:59:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   59 |   scanf("%d",&l);
      |   ~~~~~^~~~~~~~~
kovanice.cpp:60:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   60 |   scanf(" %c",&cc);
      |   ~~~~~^~~~~~~~~~~
kovanice.cpp:61:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   61 |   scanf("%d",&r);
      |   ~~~~~^~~~~~~~~

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 7404 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 97 ms 11852 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 127 ms 8480 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 346 ms 16588 KB Output isn't correct
2 Halted 0 ms 0 KB -