Submission #609526

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
609526	2022-07-27T16:50:45 Z	HediChehaidar	Toy Train (IOI17_train)	C++17	0 / 100	7 ms	1108 KB

train

#include "train.h"

#include<bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef double db;
ll gcd(ll a , ll b) {return b ? gcd(b , a % b) : a ;} // greatest common divisor (PGCD)
ll lcm(ll a , ll b) {return (a * b) / gcd(a , b);} // least common multiple (PPCM)
#define ss second
#define ff first
#define all(x) (x).begin() , (x).end()
#define pb push_back
#define vi vector<int>
#define vii vector<pair<int,int>>
#define vl vector<ll>
#define vll vector<pair<ll,ll>>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pdd  pair<double,double>
#define vdd  vector<pdd>
#define dte  tuple<double , double , double>
using namespace std;
const int INF = 1000*1000*1000; // 1 e 9
const int MOD = 1e9 + 7;//998244353 ;
const double EPS = 0.000000001; // 1 e -9
const ll inf = (ll)1e18;

int n , m;
vi adj[5050];
vi a , ch ;
bool dp[5050];
bool vis[5050];
bool solve(int pos){
    if(vis[pos]) return dp[pos];
    vis[pos] = true;
    if(adj[pos].size() == 1 && adj[pos][0] == pos + 1) return dp[pos] = solve(pos + 1);
    if( ch[pos] ){
        return dp[pos] = a[pos] ? 1 : (adj[pos].size() == 2 && solve(pos + 1));
    }
    return dp[pos] = a[pos] ? (adj[pos].size() == 2 && solve(pos + 1)) : 0;
}
vi who_wins(vi A , vi R , vi u , vi v){
    n = A.size(); m = u.size(); a = A; ch = R;
    vi ans; for(int i = 0 ; i < n ; i++) ans.pb(0);
    for(int i = 0 ; i < m ; i++){
        if(u[i] != v[i] && v[i] != u[i] + 1){
            return ans;
        }
        adj[u[i]].pb(v[i]);
    }
    assert(m < 2 * n);
    //assert(false);
    for(int i = 0 ; i < n ; i++) ans[i] = solve(i);
    return ans;
}
/*int main(){
    //ifstream fin ("testing.txt");
    //ofstream fout ("output.txt");
    ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    int nn , mm; cin>>nn>>mm;
    vi u(mm) , v(mm) , aa(nn) , cc(nn);
    for(int i = 0 ; i < nn ; i++) cin>>aa[i];
    for(int i = 0 ; i < nn ; i++) cin>>cc[i];
    for(int i = 0 ; i < mm ; i++) cin>>u[i]>>v[i];
    for(auto c : who_wins(aa , cc , u , v)  ) cout << c << " "; cout << "\n";
    return 0;
}*/
/*
6 11
0 1 1 1 0 1
0 1 0 0 1 1
0 0
1 1
2 2
3 3
4 4
5 5
0 1
1 2
2 3
3 4
4 5
*/
/*
    Think of : BS / DFS / BFS / SSSP / SCC / MSP / MAX FLOW / TOPSORT / LCA / MATRIX / DP(bitmask) / 2 POINTERS / SEG TREE / MATH / UN FIND / MO / HLD
    Read the statement CAREFULLY !!
    Make a GREADY APPROACH !!!! (start from highest / lowest)
    Make your own TESTS !!
    Be careful from CORNER CASES !
*/

Subtask #1
0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	848 KB	Output is correct
2	Incorrect	6 ms	820 KB	3rd lines differ - on the 4997th token, expected: '1', found: '0'
3	Halted	0 ms	0 KB	-

Subtask #2
0 / 10.0

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

Subtask #3
0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	1072 KB	Output is correct
2	Correct	6 ms	1080 KB	Output is correct
3	Correct	6 ms	1108 KB	Output is correct
4	Incorrect	6 ms	1108 KB	3rd lines differ - on the 1st token, expected: '1', found: '0'
5	Halted	0 ms	0 KB	-