oj.uz

Submission #416594

# Submission time Handle Problem Language Result Execution time Memory
416594 2021-06-02T16:40:34 Z yanire Toy Train (IOI17_train) C++11
0 / 100
 1118 ms 1532 KB 
#include <bits/stdc++.h>
using namespace std;
#include "train.h"
#define fin(i,s,n) for(auto i = s; i < n; ++i)
#define fine(i,s,n) for(auto i = s; i <= n; ++i)
#define pb push_back
#define eb emplace_back
#define x first
#define y second
#define all(x) (x).begin(),(x).end()
#define chkmin(a,b) a = min(a,b)
#define chkmax(a,b) a = max(a,b)
using stdvec = vector<int>;
using ii = pair<int,int>;
using vi = vector<int>;
using vvi = vector<vi>;
using vii = vector<ii>;
#define sz(a) int((a).size())
const int maxn = 5005;
vi G[maxn],T[maxn],g[maxn];
bool vis[maxn];
int id[maxn],c[maxn],p[maxn];
vi lst;
void dfs(int u) {
    if(vis[u]) return;
    vis[u] = 1;
    for(int v : G[u]) dfs(v);
    lst.pb(u);
}
void mark(int u, int cid) {
    if(!vis[u]) return;
    vis[u] = 0,id[u] = cid;
    for(int v : T[u]) mark(v,cid);
}

bool bdfs(int u) {
//    cout << "bdfs("<<u<<") called\n";
    if(c[u]) return /*cout << "cu 1\n",*/1;
    if(vis[u]) return /*cout << "already been here\n",*/0;
    vis[u] = 1;
    int cnt = 0;
    for(int v : g[u]) {
        if(u==v)return /*cout<<"self loop, bdfs("<<u<<") returns 0\n",*/0;
        cnt += bdfs(v);
    }
//    cout << "at "<<u<<",cnt="<<cnt<<",sz(g)="<<sz(g[u])<<endl;
    if(cnt==sz(g[u])) return 1;
    return 0;
}


vi who_wins(vi a, vi r, vi u, vi v) {
    int n = a.size(),m = u.size();
    fin(i,0,m) g[u[i]].pb(v[i]);
    fin(i,0,n) p[i]=a[i],c[i]=r[i];
    /*fin(i,0,m) G[u[i]].pb(v[i]),T[v[i]].pb(u[i]);
    fin(i,0,n) p[i] = a[i];
    lst.clear();
    fin(i,0,n) dfs(i);
    int lid = 0;
    reverse(all(lst));
    fin(i,0,n) if(vis[lst[i]]) mark(lst[i],lid++);
    fin(i,0,n) c[id[i]] |= r[i];
    vi deg(n,0);
    fin(i,0,m) if(id[u[i]]!=id[v[i]]) g[id[v[i]]].pb(id[u[i]]),++deg[id[u[i]]];
    queue<int> q;
    fin(i,0,n) if(!deg[i]) q.push(i);
    while(!q.empty()) {
        int cu = q.front();
        q.pop();
        for(int nv : g[cu]) {
            c[nv] |= c[cu];
            if(--deg[nv]==0) q.push(nv);
        }
    }*/
    vi res(n);
    fin(i,0,n) {
//        res[i] = c[id[i]];
        memset(vis,0,sizeof vis);
//        cout << "TESTING " << i << endl;
        res[i] = bdfs(i);
    }
	return res;
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 972 KB 3rd lines differ - on the 1st token, expected: '0', found: '1'
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 588 KB 3rd lines differ - on the 1st token, expected: '0', found: '1'
2 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 95 ms 1532 KB 3rd lines differ - on the 1st token, expected: '0', found: '1'
2 Halted 0 ms 0 KB -

Subtask #4
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 7 ms 1100 KB 3rd lines differ - on the 696th token, expected: '0', found: '1'
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 1118 ms 1444 KB 3rd lines differ - on the 1st token, expected: '1', found: '0'
2 Halted 0 ms 0 KB -

Subtask #6
0 / 51.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 972 KB 3rd lines differ - on the 1st token, expected: '0', found: '1'
2 Halted 0 ms 0 KB -