이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
#define sz(x) int(x.size())
#define in(x) freopen(x, "r", stdin)
#define out(x) freopen(x, "w", stdout)
#define N 100500
#define oo ll(1e16)
#define ft first
#define sd second
#define pb push_back
#define ppb pop_back
#define el '\n'
#define elf endl
#define base ll(1e9 + 7)
using namespace std;
typedef long long ll;
typedef long double ld;
ll a, b, m, kl[N], v[N], u[N], mx;
set <ll> se[N];
int main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
// in("input.txt");
cin >> a >> b >> m;
for (ll i = 0; i < m; i++)
cin >> v[i] >> u[i], v[i]--, u[i]--, kl[v[i]]++, kl[a + u[i]]++;
for (ll i = 0; i < a + b; i++)
mx = max(mx, kl[i]);
ll lg = 0;
while ((1ll << lg) < mx)
lg++;
mx = (1ll << lg);
for (ll i = 0; i < a + b; i++)
for (ll j = 1; j <= mx; j++)
se[i].insert(j);
cout << mx << el;
for (ll i = 0; i < m; i++) {
for (set <ll> :: iterator it = se[v[i]].begin(); it != se[v[i]].end(); it++)
if (se[a + u[i]].find(*it) != se[a + u[i]].end()) {
cout << (*it) << el;
se[a + u[i]].erase(se[a + u[i]].find(*it));
se[v[i]].erase(it);
break;
}
}
}
# | 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... |
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |