#include <bits/stdc++.h>
//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("-O3")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("fast-math")
//#pragma GCC optimize("no-stack-protector")
#define F first
#define S second
#define sz(x) int(x.size())
#define pb push_back
#define N 100005
#define M ll(1e9 + 7)
using namespace std;
typedef long double ld;
typedef long long ll;
typedef short int si;
int ans[N * 5];
int mk[N][2];
int main()
{
//freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout);
ios_base::sync_with_stdio(0); istream::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n, m, k;
cin >> n >> m >> k;
int clr = 1;
vector <pair <int, pair <int, int> > > g(k);
for (int i = 0; i < k; i++)
{
cin >> g[i].S.F >> g[i].S.S;
g[i].F = i;
}
vector <pair <int, pair <int, int> > > nxt;
while (sz(g) > 0)
{
nxt.clear();
for (auto it : g)
{
int a = it.S.F, b = it.S.S;
if (mk[a][0] != clr && mk[b][1] != clr)
{
mk[a][0] = mk[b][1] = clr;
ans[it.F] = clr;
}
else nxt.pb(it);
}
g = nxt;
clr++;
}
cout << clr - 1 << endl;
for (int i = 0; i < k; i++) cout << ans[i] << '\n';
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
5 ms |
384 KB |
too many colors |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
384 KB |
Output is correct |
2 |
Correct |
5 ms |
384 KB |
Output is correct |
3 |
Correct |
5 ms |
384 KB |
Output is correct |
4 |
Correct |
5 ms |
384 KB |
Output is correct |
5 |
Correct |
5 ms |
384 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
6 ms |
640 KB |
too many colors |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
8 ms |
768 KB |
Output is correct |
2 |
Correct |
6 ms |
640 KB |
Output is correct |
3 |
Correct |
6 ms |
640 KB |
Output is correct |
4 |
Correct |
6 ms |
640 KB |
Output is correct |
5 |
Correct |
6 ms |
512 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
133 ms |
16872 KB |
too many colors |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
135 ms |
16872 KB |
too many colors |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
12088 ms |
17660 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
751 ms |
17752 KB |
Output is correct |
2 |
Correct |
244 ms |
20700 KB |
Output is correct |
3 |
Correct |
394 ms |
20484 KB |
Output is correct |
4 |
Correct |
172 ms |
19932 KB |
Output is correct |
5 |
Correct |
134 ms |
17256 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4702 ms |
16528 KB |
Output is correct |
2 |
Correct |
2891 ms |
20716 KB |
Output is correct |
3 |
Correct |
206 ms |
20700 KB |
Output is correct |
4 |
Correct |
171 ms |
20060 KB |
Output is correct |
5 |
Correct |
280 ms |
18012 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4331 ms |
16396 KB |
Output is correct |
2 |
Execution timed out |
12033 ms |
20072 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |