oj.uz

Submission #846421

# Submission time Handle Problem Language Result Execution time Memory
846421 2023-09-07T14:32:31 Z vjudge1 KOVANICE (COI15_kovanice) C++17
0 / 100
 101 ms 5972 KB 
#include <bits/stdc++.h>
#define endl "\n"
#define pb push_back
#define int long long
using namespace std;

const int inf = 2e18 + 5;
const int N = 3e5 + 5;
const int mod = 1e9 + 7;

vector<int> par(N);

int find(int a){
 if(a == par[a]) return a;
 return par[a] = find(par[a]);
}

void merge(int a, int b){
  a = find(a), b = find(b);
  par[a] = b;
}


int32_t main(){
  //freopen("in.txt","r", stdin);
  int n, m, v;
  cin>>n>>m>>v;

  vector<array<int, 2> > type;
  vector<int> ans(m+1);

  for(int i = 0; i < v; i++){
     string s;
     cin>>s;

     if(s[1] == '='){
        merge(s[0] - '0', s[2] - '0');
     }
     else{
        int x = s[0] - '0', y = s[2] - '0';
        x = find(x), y = find(y);
        ans[x] = 2;
        ans[y] = 1;
     }
  }



  for(int i = 1; i <= m; i++){
    if(ans[find(i)]) cout<<"K"<<ans[find(i)]<<endl;
    else cout<<"?"<<endl;
  }
  return 0;
}

Subtask #1
0 / 10.0

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

Subtask #2
0 / 40.0

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

Subtask #3
0 / 10.0

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

Subtask #4
0 / 40.0

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