답안 #282210

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
282210	2020-08-24T06:51:00 Z	khangal	장난감 기차 (IOI17_train)	C++14	11 / 100	1473 ms	30600 KB

train

#include<bits/stdc++.h>
#include "train.h"

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef double db;
typedef pair<ll,ll> pl;
typedef vector<ll> vl;
typedef vector<vl> vvl;
#define po pop_back
#define pb push_back
#define mk make_pair
#define mt make_tuple
#define lw lower_bound
#define up upper_bound
#define ff first
#define ss second
#define BOOST ios_base::sync_with_stdio(); cin.tie(0); cout.tie(0);
#define MOD 1000000007
#define MAX 1e18
#define MIN -1e18
#define rep(i,a,b) for(ll i=a;i<=b;i++)
#define per(i,a,b) for(ll i=b;i>=a;i--)
#define con continue
#define freopen freopen("input.txt", "r", stdin);freopen("output.txt", "w", stdout);
#define PI 3.14159265358979323846264338327950288419716939937510582097494459230781640628
#define read(x) scanf("%lld",&x);
#define print(x) printf("%lld ",x);
#define endl '\n';
// typedef tree<ll , null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
// template< typename T>
// using indexed_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
ll n,m,ans,mid,mn,mx,cnt,T,sum,h1,h2,e[1234567],b[1234567],c[1234567],d[1<<20],k,i,j,l,r,h,a[1234567],w,x,y,z;
bool used[1234567];
vector<int> v[1234567],vec,vv1,vv2;
string s1,s;
int sz[1234567],par[1234567];
int tr[5234567];
ll dx[4]={-1,1,0,0},dy[4]={0,0,-1,1},c1[123][123];

    bool ok;
    bool vis[5000];
void dfs(ll x){
    if(ok==0)vis[x]=1;
    ok=0;
    for(auto u:v[x])if(vis[u]==0)dfs(u);
}
vector<int> who_wins(vector<int> a, vector<int> r, vector<int> U, vector<int> V){
    int n=a.size() , m=U.size();
    for(int i=0;i<m;i++){
        v[U[i]].pb(V[i]);
    }
    for(int i=0;i<n;i++){
        if(r[i]==1){
            memset(vis, false, sizeof vis);
            ok=true;
            dfs(i);
            if(vis[i]) c[i]=true;
        }
    }
    vector<int>ans;
    for(int i=0;i<n;i++){
        ok=false;
        memset(vis, false, sizeof vis);
        dfs(i);
        bool ok1=false;
        for(int i=0;i<n;i++){
            if(r[i] && vis[i] && c[i]) ok1=true;
        }
        if(ok1) ans.pb(1);
        else ans.pb(0);
    }
    return ans;
}

Subtask #1
0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	397 ms	30072 KB	3rd lines differ - on the 1st token, expected: '0', found: '1'
2	Halted	0 ms	0 KB	-

Subtask #2
0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	19 ms	29312 KB	3rd lines differ - on the 8th token, expected: '0', found: '1'
2	Halted	0 ms	0 KB	-

Subtask #3
11.0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	217 ms	30356 KB	Output is correct
2	Correct	252 ms	30504 KB	Output is correct
3	Correct	298 ms	30328 KB	Output is correct
4	Correct	1272 ms	30600 KB	Output is correct
5	Correct	791 ms	30328 KB	Output is correct
6	Correct	628 ms	30328 KB	Output is correct
7	Correct	817 ms	30328 KB	Output is correct
8	Correct	293 ms	30200 KB	Output is correct
9	Correct	271 ms	30200 KB	Output is correct
10	Correct	376 ms	30328 KB	Output is correct
11	Correct	325 ms	30200 KB	Output is correct
12	Correct	74 ms	30200 KB	Output is correct
13	Correct	983 ms	30468 KB	Output is correct
14	Correct	958 ms	30456 KB	Output is correct
15	Correct	1071 ms	30328 KB	Output is correct
16	Correct	986 ms	30456 KB	Output is correct
17	Correct	1014 ms	30328 KB	Output is correct
18	Correct	555 ms	30072 KB	Output is correct