#include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
#define yes cout << "Yes" << "\n"
#define no cout << "No" << "\n"
#define pb push_back
#define F first
#define S second
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair <int, int> pii;
typedef vector <pii> vii;
typedef vector <ll> vi;
typedef vector <vi> vvi;
template<typename T>
void read(vector<T>& v) {
for (auto &x : v) cin >> x;
}
template<typename T>
void print(const vector<T>& v) {
for (auto &x : v) cout << x << ' ';
cout << "\n";
}
const ll MAX = 1e6 + 5;
const ll MOD = 1e9 + 7;
void solve() {
int n, m, v;
cin >> n >> m >> v;
vii e;
vector <string> res(m + 1, "?");
while (v--) {
int a, b;
char c;
cin >> a >> c >> b;
if (c == '<') {
res[a] = "K1";
res[b] = "K2";
}
else {
e.pb({a, b});
}
}
for (auto x : e) {
if (res[x.F] != "?") {
res[x.S] = res[x.F];
}
else if (res[x.S] != "?") {
res[x.F] = res[x.S];
}
}
for (int i = 1; i <= m; i++) {
cout << res[i] << "\n";
}
}
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int t = 1;
//cin >> t;
for (int i = 1; i <= t; i++) {
solve();
}
}
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |