#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];
string s;
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 read(){
int ind=0;
l=0,r=0;
for(int i=0;i<s.size();i++){
if(s[i]=='<'||s[i]=='>'||s[i]=='='){
cc=s[i];
ind=i;
break;
}
int x=s[i]-48;
l*=10;
l+=x;
}
for(int i=ind+1;i<s.size();i++){
int x=s[i]-48;
r*=10;
r+=x;
}
}
void solve(){
cin>>n>>m>>q;
vector<pii>a,b;
while(q--){
cin>>l>>cc>>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 read()':
kovanice.cpp:59:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
59 | for(int i=0;i<s.size();i++){
| ~^~~~~~~~~
kovanice.cpp:69:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
69 | for(int i=ind+1;i<s.size();i++){
| ~^~~~~~~~~
kovanice.cpp: In function 'void solve()':
kovanice.cpp:91: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]
91 | for(int i=0;i<a.size();i++){
| ~^~~~~~~~~
kovanice.cpp:98: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]
98 | for(int i=0;i<b.size();i++){
| ~^~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
6 ms |
7372 KB |
Output is correct |
| 2 |
Correct |
6 ms |
7356 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
72 ms |
11968 KB |
Output is correct |
| 2 |
Correct |
77 ms |
11704 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
109 ms |
8448 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
322 ms |
16580 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
