Submission #375366

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
375366	2021-03-09T10:15:21 Z	gustason	Fire drill (LMIO18_sauga)	C++14	44.2593 / 100	948 ms	5100 KB

sauga

#include<bits/stdc++.h>
using namespace std;
using ll = long long;

mt19937 rnd(time(NULL));

const int maxN = 1005;
int best = 0;
vector<int> ans, seq, order;
int t, n, S;
vector<int> adj[maxN];
vector<char> col;
vector<bool> ok;
void dfs(int v) {
    if (!ok[v]) return;
    col[v] = '1';

    for(int u : adj[v]) {
        if (!ok[u]) continue;
       // cout << v << " -> " << u << " " << col[u] << "\n";
        if (col[u] == '1') {
            ok[v] = false;
            return;
        } else if (col[u] == '0') {
            // cout << u << "->" << v << "\n";
            dfs(u);
        }
    }
    col[v] = '2';
    seq.push_back(v);
}
void solve() {
    // cerr << "\n";
    for(int i = 1; i <= n; i++) {
        random_shuffle(adj[i].begin(), adj[i].end());
    }
    random_shuffle(order.begin(), order.end());

    vector<int>().swap(seq);
    for(int i = 0; i <= n; i++) {
        col[i] = '0';
        ok[i] = true;
    }

    for(int i : order) {
//        cout << i << " ";
        if (col[i] == '0')
            dfs(i);
    }
//    cerr << "\n";

    vector<int> curr;

    int good = n;
    for(int i = 1; i <= n; i++) {
        if (!ok[i])
            good--;
    }
//    for(int i : curr) {
//        cout << i << " ";
//    } cout << "\n";
    if (good <= best) return;

    for(int i : seq) {
        curr.push_back(i);
    }
    for(int i = 1; i <= n; i++) {
        if (!ok[i])
            curr.push_back(i);
    }

    // cout << good << "\n";
    ans = curr;
}
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    srand(time(NULL));

    cin >> t >> n >> S;
    order.resize(n);
    col.resize(n+1);
    ok.resize(n+1);
    iota(order.begin(), order.end(), 1);
    for(int i = 0; i < n; i++) {
        int m;
        cin >> m;
        for(int j = 0; j < m; j++) {
            int x;
            cin >> x;
            adj[i+1].push_back(x);
        }
    }

    clock_t start = clock();
    while((double) (clock() - start) / CLOCKS_PER_SEC < 0.9) {
        solve();
    }

    cerr << "\n";
    for(int i : ans) {
        cout << i << "\n";
    }
    return 0;
}

Subtask #1

44.2592898932 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	948 ms	5100 KB	Output is correct
2	Partially correct	901 ms	492 KB	Output is partially correct
3	Partially correct	901 ms	492 KB	Output is partially correct
4	Partially correct	902 ms	620 KB	Output is partially correct
5	Partially correct	901 ms	492 KB	Output is partially correct
6	Partially correct	902 ms	620 KB	Output is partially correct
7	Partially correct	908 ms	1132 KB	Output is partially correct
8	Incorrect	942 ms	4844 KB	Output isn't correct
9	Partially correct	906 ms	1004 KB	Output is partially correct
10	Partially correct	901 ms	492 KB	Output is partially correct