Submission #781964

#	Time	Username	Problem	Language	Result	Execution time	Memory
781964		devariaota	Naboj (COCI22_naboj)	C++17	25 / 110	422 ms	18908 KiB

naboj

#include<bits/stdc++.h>
using namespace std;
#define ioss ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define pii pair<int, int>
#define fi first
#define se second
#define pb push_back
int n, m;
vector<int> adj[200004];
bool vis[200004];
vector<int> st;
void topsort(int u) {
    if(vis[u]) return;
    vis[u] = 1;
    for(auto v :  adj[u]) {
        if(!vis[v]) topsort(v);
    }
    st.push_back(u);
}
int main() {
    ioss;
    cin >> n >> m;
    set<int> tmp;
    for(int i = 0; i < m; i++) {
        int a, b; cin >> a >> b;
        tmp.insert(a);
        adj[b].pb(a);
    }

    if(tmp.size() == n) {
        cout << -1 << endl;
        return 0;
    }

    for(int i = 1; i <= n; i++) {
        if(!vis[i]) topsort(i);
    }
    cout << st.size() << endl;
    while(!st.empty()) {
        int u = st.back();
        st.pop_back();
        if(tmp.count(u)) cout << u << " " << 1 << endl;
        else cout << u << " " << 0 << endl;
    }
}

Compilation message (stderr)

naboj.cpp: In function 'int main()':
naboj.cpp:30:19: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   30 |     if(tmp.size() == n) {
      |        ~~~~~~~~~~~^~~~

• Subtask 1: 0 / 15
• Subtask 2: 25 / 25
• Subtask 3: 0 / 70