oj.uz

Submission #227939

# Submission time Handle Problem Language Result Execution time Memory
227939 2020-04-29T09:39:11 Z kartel Teoretičar (COCI18_teoreticar) C++14
26 / 130
 242 ms 44024 KB 
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define in(x) freopen(x, "r", stdin)
#define out(x) freopen(x, "w", stdout)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-O3")
#define F first
#define S second
#define pb push_back
#define N +100500
#define M ll(1e9 + 7)
#define sz(x) (int)x.size()
#define re return
#define oo ll(1e18)
#define el '\n'
using namespace std;
//using namespace __gnu_pbds;
//typedef tree <int, null_type, less_equal <int> , rb_tree_tag, tree_order_statistics_node_update> ordered_set;
typedef long long ll;
typedef long double ld;

int ln, rn, m, i, j, ans, col, v, x[N], y[N], n;
set <int> se[N];
vector <int> g[N];

int main()
{
    srand(time(0));
    ios_base::sync_with_stdio(0);
    iostream::sync_with_stdio(0);
    ios::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);

//    in("sum.in");
//    out("output.txt");

    cin >> ln >> rn >> m;
    for (i = 1; i <= m; i++)
    {
        cin >> x[i] >> y[i];
        y[i] += ln;
        g[x[i]].pb(y[i]);
        g[y[i]].pb(x[i]);
    }

    n = ln + rn;
    ans = 0;

    for (i = 1; i <= n; i++) ans = max(ans, int(g[i].size()));

    int mx = 1;
    while (mx < ans) mx *= 2;

    cout << mx << el;
    for (i = 1; i <= n; i++)
        for (j = 1; j <= mx; j++)
            se[i].insert(j);

    for (i = 1; i <= m; i++)
    {
        for (auto col : se[x[i]])
        {
            if (se[y[i]].find(col) != se[y[i]].end())
            {
                se[y[i]].erase(col);
                se[x[i]].erase(col);

                cout << col << el;
                break;
            }
        }
    }
}


// 119 78 175 411

Subtask #1
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 9 ms 7424 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 7552 KB Output is correct
2 Correct 10 ms 7808 KB Output is correct
3 Correct 9 ms 7552 KB Output is correct
4 Correct 9 ms 7424 KB Output is correct
5 Correct 9 ms 7424 KB Output is correct

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 13 ms 8832 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -

Subtask #4
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 113 ms 44024 KB Output is correct
2 Correct 17 ms 9088 KB Output is correct
3 Correct 27 ms 15360 KB Output is correct
4 Correct 12 ms 8064 KB Output is correct
5 Correct 12 ms 7808 KB Output is correct

Subtask #5
0 / 13.0

# Verdict Execution time Memory Grader output
1 Runtime error 17 ms 15040 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Runtime error 20 ms 14976 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #7
0 / 13.0

# Verdict Execution time Memory Grader output
1 Runtime error 242 ms 31288 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #8
0 / 13.0

# Verdict Execution time Memory Grader output
1 Runtime error 135 ms 30144 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #9
0 / 13.0

# Verdict Execution time Memory Grader output
1 Runtime error 117 ms 26516 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #10
0 / 13.0

# Verdict Execution time Memory Grader output
1 Runtime error 111 ms 25312 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -