Submission #699476

#	Time	Username	Problem	Language	Result	Execution time	Memory
699476		Cross_Ratio	Teoretičar (COCI18_teoreticar)	C++14	26 / 130	12060 ms	46988 KiB

teoreticar

#include <bits/stdc++.h>
using namespace std;
int num[500005];
vector<array<int, 2>> adj[100005];
set<int> C[100005];
int num_cnt = 0;
signed main() {
    cin.sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int L, R, M;
    cin >> L >> R >> M;
    int i, j;
    for(i=0;i<M;i++) {
        int a, b;
        cin >> a >> b;
        adj[a-1].push_back({b-1, i});
    }
    vector<int> V;
    for(i=0;i<L;i++) V.push_back(i);
    sort(V.begin(),V.end(),[&](int x, int y) {
         return adj[x].size()>adj[y].size();
         });
    for(int i : V) {
        set<int> S;
        for(auto n : adj[i]) {
            bool isPos = false;
            for(j=0;j<num_cnt;j++) {
                if(S.find(j) == S.end() && C[j].find(n[0])==C[j].end()) {
                    num[n[1]] = j;
                    C[j].insert(n[0]);
                    S.insert(j);
                    isPos = true;
                    break;
                }
            }
            if(!isPos) {
                num[n[1]] = num_cnt;
                C[num_cnt].insert(n[0]);
                S.insert(num_cnt);
                num_cnt++;
            }
        }
    }
    cout << num_cnt << '\n';
    for(i=0;i<M;i++) cout << num[i] + 1 << '\n';
}

• Subtask 1: 0 / 13
• Subtask 2: 13 / 13
• Subtask 3: 0 / 13
• Subtask 4: 0 / 13
• Subtask 5: 0 / 13
• Subtask 6: 0 / 13
• Subtask 7: 0 / 13
• Subtask 8: 13 / 13
• Subtask 9: 0 / 13
• Subtask 10: 0 / 13