#include <iostream>
#include <sstream>
#include <queue>
#include <stack>
#include <vector>
#include <cstring>
#include <cmath>
#include <map>
#include <unordered_map>
#include <set>
#include <algorithm>
#include <iomanip>
#define F first
#define S second
#define PB push_back
#define PF push_front
#define MP make_pair
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
const int maxn = 1e5 + 37;
int col[maxn], edge[maxn], match[maxn];
vector <pii> g[maxn];
bool visited[maxn];
bool dfs (int v) {
if (visited[v])
return false;
visited[v] = 1;
for (auto u : g[v]) {
if (col[u.S] != 0)
continue;
if (match[u.F] == -1 or dfs (match[u.F])) {
match[u.F] = v;
edge[u.F] = u.S;
return true;
}
}
return false;
}
int main() {
ios_base::sync_with_stdio(false);
int n, m, e;
cin >> n >> m >> e;
for (int i = 1; i <= e; i++) {
int v, u;
cin >> v >> u;
g[v].PB ({u, i});
}
int c = 1, cop = e;
while (cop) {
memset (match, -1, sizeof match);
int tmp = 0;
for (int i = 1; i <= n; i++) {
memset (visited, 0, sizeof visited);
tmp += dfs (i);
}
cop -= tmp;
for (int i = 1; i <= m; i++)
if (match[i] != -1)
col[edge[i]] = c;
c ++;
}
cout << c - 1 << endl;
for (int i = 1; i <= e; i++)
cout << col[i] << '\n';
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
6 ms |
3192 KB |
Output is correct |
2 |
Correct |
8 ms |
3196 KB |
Output is correct |
3 |
Correct |
8 ms |
3256 KB |
Output is correct |
4 |
Correct |
5 ms |
3260 KB |
Output is correct |
5 |
Correct |
5 ms |
3304 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
19 ms |
3304 KB |
Output is correct |
2 |
Correct |
17 ms |
3364 KB |
Output is correct |
3 |
Correct |
7 ms |
3408 KB |
Output is correct |
4 |
Correct |
5 ms |
3408 KB |
Output is correct |
5 |
Correct |
5 ms |
3408 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
92 ms |
3568 KB |
too many colors |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
42 ms |
3568 KB |
Output is correct |
2 |
Correct |
87 ms |
3592 KB |
Output is correct |
3 |
Correct |
359 ms |
3592 KB |
Output is correct |
4 |
Incorrect |
33 ms |
3592 KB |
too many colors |
5 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
143 ms |
16408 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
151 ms |
16604 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
2439 ms |
16604 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
199 ms |
18324 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
118 ms |
18324 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
728 ms |
18324 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |