oj.uz

Submission #928512

# Submission time Handle Problem Language Result Execution time Memory
928512 2024-02-16T14:06:22 Z Whisper Wand (COCI19_wand) C++17
63 / 70
 26 ms 10588 KB 
#include <bits/stdc++.h>

using namespace std;
using ll = long long;

#define int long long
#define FOR(i, a, b) for ( int i = a ; i <= b ; i++ )
#define FORD(i, a, b) for (int i = b; i >= a; i --)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPD(i, n) for (int i = n - 1; i >= 0; --i)
#define pii pair<int , int>
#define fi first
#define se second
#define Lg(x) 31 - __builtin_clz(x)

#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)

constexpr ll LINF = (1ll << 60);
constexpr int INF = (1ll << 30);
constexpr int MAX = 2e5 + 5;
constexpr int Mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

void setupIO(){
    #define name "Whisper"
    //Phu Trong from Nguyen Tat Thanh High School for gifted student
    srand(time(NULL));
    cin.tie(nullptr)->sync_with_stdio(false); cout.tie(nullptr);
    //freopen(name".inp", "r", stdin);
    //freopen(name".out", "w", stdout);
    cout << fixed << setprecision(10);
}

template <class X, class Y>
    bool minimize(X &x, const Y &y){
        X eps = 1e-9;
        if (x > y + eps) {x = y; return 1;}
        return 0;
    }

template <class X, class Y>
    bool maximize(X &x, const Y &y){
        X eps = 1e-9;
        if (x + eps < y) {x = y; return 1;}
        return 0;
    }
int numNode, numEdge;
int vis[MAX];
int ans[MAX];
vector<int> adj[MAX];
void dfs(int u){
    vis[u] = 1;
    for(auto&v : adj[u]){
        ans[v] = 1;
        if (vis[v]) continue;
        dfs(v);
    }
    vis[u] = 0;
}
void Whisper(){
    cin >> numNode >> numEdge;
    for (int i = 1; i <= numEdge; ++i){
        int u, v; cin >> u >> v;
        adj[v].push_back(u);
    }
    dfs(1);
    ans[1] = (adj[1].size() == 0);
    for (int i = 1; i <= numNode; ++i) cout << ans[i];
}


signed main(){
    setupIO();
    int Test = 1;
//    cin >> Test;
    for ( int i = 1 ; i <= Test ; i++ ){
        Whisper();
        if (i < Test) cout << '\n';
    }
}

Subtask #1
63.0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6748 KB Output is correct
2 Incorrect 1 ms 6748 KB Output isn't correct
3 Correct 21 ms 10260 KB Output is correct
4 Correct 24 ms 10308 KB Output is correct
5 Correct 20 ms 10328 KB Output is correct
6 Correct 21 ms 10588 KB Output is correct
7 Correct 21 ms 10332 KB Output is correct
8 Correct 24 ms 10588 KB Output is correct
9 Correct 21 ms 10068 KB Output is correct
10 Correct 26 ms 10588 KB Output is correct