Submission #660362

#	Time	Username	Problem	Language	Result	Execution time	Memory
660362		Dec0Dedd	Information (CEOI08_information)	C++14	41 / 100	450 ms	20672 KiB

information

#include <bits/stdc++.h>

using namespace std;

#define pii pair<int, int>

const int N = 2e3+1;
const int M = 1e6+1;

int c[M], n, m;
bool vis[N];
vector<pii> G[N], GT[N];

void dfs(int v) {
    vis[v]=true;
    for (auto u : G[v]) {
        if (vis[u.first]) continue;
        c[u.second]=1, dfs(u.first);
    }
}

void dfs2(int v) {
    vis[v]=true;
    for (auto u : G[v]) {
        if (vis[u.first]) continue;
        if (c[u.second] == 0) {
            c[u.second]=2; dfs2(u.first);
        } else { assert(c[u.second] == 1);
            bool ok=false;
            for (auto z : GT[u.first]) {
                if (c[z.second] == 0) {
                    ok=true;
                    c[z.second]=1;
                    break;
                }
            }

            if (ok) {
                c[u.second]=2;
                dfs2(u.first);
            }
        }
    }
}

int main() {
    cin>>n>>m;
    for (int i=1; i<=m; ++i) {
        int a, b; cin>>a>>b;
        G[a].push_back({b, i});
        GT[b].push_back({a, i});
    } dfs(1);
    memset(vis, false, sizeof(vis));
    dfs2(1);

    vector<int> l, r;
    for (int i=1; i<=m; ++i) {
        if (c[i] == 1) l.push_back(i);
        else if (c[i] == 2) r.push_back(i);
    }

    if ((int)l.size() < n-1 || (int)r.size() < n-1) cout<<"NONE\n";
    else {
        for (auto u : l) cout<<u<<" ";
        cout<<"\n";
        for (auto u : r) cout<<u<<" ";
        cout<<"\n";
    }
}

• Subtask 1: 0 / 4
• Subtask 2: 4 / 4
• Subtask 3: 4 / 4
• Subtask 4: 0 / 4
• Subtask 5: 0 / 4
• Subtask 6: 0 / 4
• Subtask 7: 4 / 4
• Subtask 8: 4 / 4
• Subtask 9: 4 / 4
• Subtask 10: 0 / 4
• Subtask 11: 0 / 4
• Subtask 12: 0 / 4
• Subtask 13: 0 / 4
• Subtask 14: 4 / 4
• Subtask 15: 4 / 4
• Subtask 16: 0 / 4
• Subtask 17: 0 / 4
• Subtask 18: 4 / 4
• Subtask 19: 4 / 4
• Subtask 20: 0 / 4
• Subtask 21: 5 / 5
• Subtask 22: 0 / 5
• Subtask 23: 0 / 5
• Subtask 24: 0 / 5