oj.uz

답안 #227933

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
227933 2020-04-29T09:21:57 Z NONAME Teoretičar (COCI18_teoreticar) C++17
26 / 130
 838 ms 262148 KB 
#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;
            }
    }
}

Subtask #1
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 7 ms 5120 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 5248 KB Output is correct
2 Correct 9 ms 5376 KB Output is correct
3 Correct 8 ms 5120 KB Output is correct
4 Correct 8 ms 5120 KB Output is correct
5 Correct 8 ms 5120 KB Output is correct

Subtask #3
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 11 ms 6400 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -

Subtask #4
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 108 ms 41592 KB Output is correct
2 Correct 12 ms 6656 KB Output is correct
3 Correct 34 ms 12792 KB Output is correct
4 Correct 12 ms 5632 KB Output is correct
5 Correct 11 ms 5504 KB Output is correct

Subtask #5
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 12 ms 10112 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 12 ms 10112 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #7
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 838 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #8
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 754 ms 258104 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -

Subtask #9
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 671 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #10
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 604 ms 262144 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -