#include <bits/stdc++.h>
using namespace std;
int n, m, v;
int parent[300005], sz[300005], rez[300005];
vector<int> G[300005];
int Find(int x) {
if (x==parent[x])
return x;
return parent[x]=Find(parent[x]);
}
void Union(int a, int b) {
a=Find(a), b=Find(b);
if (a==b) return;
if (sz[a]<sz[b])
swap(a, b);
sz[a]+=sz[b];
parent[b]=a;
}
bool vis[300005];
int dfs(int teme, int klk_pred) {
int k=0;
for (auto next:G[teme]) {
if (!vis[next])
k=max(k, 1+dfs(next, klk_pred-1));
}
if (klk_pred==k) rez[teme]=n-klk_pred;
else rez[teme]=-1;
return k;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> n >> m >> v;
string merenja[v];
for (int i=0;i<v;i++)
cin >> merenja[i];
for (int i=1;i<=m;i++)
parent[i]=i, sz[i]=1;
int br1[v], br2[v];
char znak[v];
for (int j=0;j<v;j++) {
br1[j]=br2[j]=0;
znak[j]='.';
string x=merenja[j];
for (int i=0;i<x.size();i++) {
if (isdigit(x[i])&&znak[j]=='.') br1[j]*=10, br1[j]+=x[i]-'0';
else if (isdigit(x[i])) br2[j]*=10, br2[j]+=x[i]-'0';
else znak[j]=x[i];
}
if (znak[j]=='=') Union(br1[j], br2[j]);
}
int inDegree[m+1]={0};
for (int i=0;i<v;i++) {
if (znak[i]=='<') {
G[Find(br1[i])].push_back(Find(br2[i]));
inDegree[Find(br2[i])]++;
}
}
set<int> roots;
for (int i=1;i<=m;i++)
if (inDegree[Find(i)]==0) roots.insert(Find(i));
for (auto teme:roots)
dfs(teme, n-1);
for (int i=1;i<=m;i++)
rez[i]=rez[Find(i)];
for (int i=1;i<=m;i++) {
if (rez[i]>0) cout << 'K' << rez[i] << '\n';
else cout << '?' << '\n';
}
return 0;
}
Compilation message
kovanice.cpp: In function 'int main()':
kovanice.cpp:53:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
53 | for (int i=0;i<x.size();i++) {
| ~^~~~~~~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
10840 KB |
Output is correct |
2 |
Correct |
2 ms |
10844 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
53 ms |
24156 KB |
Output is correct |
2 |
Correct |
59 ms |
24320 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
2036 ms |
15960 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
2041 ms |
35928 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |