Submission #283334

# Submission time Handle Problem Language Result Execution time Memory
283334 2020-08-25T14:43:44 Z davi_bart Toy Train (IOI17_train) C++14
5 / 100
1314 ms 1528 KB
#include <bits/stdc++.h>
#include "train.h"
using namespace std;
#define ll long long
//#define int ll
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
vector<int> charge,pers;
vector<int> p[6000];
vector<int> tempo(5010,0);
vector<int> memo(5010,-1);
int temp=1;
int dfs(int pos,int last_charge){//return 0 if cycle without charger
  if(memo[pos]>=0)return memo[pos];
  if(tempo[pos]>0){
    if(tempo[pos]>last_charge)return 0;
    return 1;
  }
  tempo[pos]=temp;
  if(charge[pos])last_charge=temp;
  temp++;
  if(pers[pos]==0){
    int sol=1;
    for(int x:p[pos]){
      temp=tempo[pos]+1;
      sol=min(sol,dfs(x,last_charge));
      if(sol==0)break;
    }
    tempo[pos]=0;
    return memo[pos]=sol;
  }else{
    int sol=0;
    for(int x:p[pos]){
      temp=tempo[pos]+1;
      sol=max(sol,dfs(x,last_charge));
      if(sol)break;
    }
    tempo[pos]=0;
    return memo[pos]=sol;
  }
}
std::vector<int> who_wins(std::vector<int> a, std::vector<int> r, std::vector<int> u, std::vector<int> v){
  pers=a;charge=r;
	vector<int> ans(a.size(),0);
	for(int i=0;i<u.size();i++)p[u[i]].push_back(v[i]);
	for(int i=0;i<a.size();i++){
    if(pers[i]){
      sort(p[i].begin(),p[i].end(),[&](int aa,int bb){
        if(charge[aa]==charge[bb])return aa<bb;
        return (bool)charge[aa];
      });
    }else{
      sort(p[i].begin(),p[i].end(),[&](int aa,int bb){
        if(charge[aa]==charge[bb])return aa<bb;
        return (bool)charge[bb];
      });
    }
	}
	for(int i=0;i<a.size();i++){
    temp=1;
    fill(tempo.begin(),tempo.end(),0);
    fill(memo.begin(),memo.end(),-1);
    ans[i]=dfs(i,-2);
	}
	return ans;
}

Compilation message

train.cpp: In function 'std::vector<int> who_wins(std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
train.cpp:44:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   44 |  for(int i=0;i<u.size();i++)p[u[i]].push_back(v[i]);
      |              ~^~~~~~~~~
train.cpp:45:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |  for(int i=0;i<a.size();i++){
      |              ~^~~~~~~~~
train.cpp:58:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   58 |  for(int i=0;i<a.size();i++){
      |              ~^~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 43 ms 896 KB Output is correct
2 Correct 43 ms 896 KB Output is correct
3 Correct 43 ms 896 KB Output is correct
4 Correct 45 ms 896 KB Output is correct
5 Correct 43 ms 896 KB Output is correct
6 Correct 45 ms 944 KB Output is correct
7 Correct 44 ms 1016 KB Output is correct
8 Correct 43 ms 896 KB Output is correct
9 Correct 43 ms 896 KB Output is correct
10 Correct 43 ms 896 KB Output is correct
11 Correct 42 ms 896 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 512 KB Output is correct
2 Correct 1 ms 512 KB Output is correct
3 Correct 1 ms 512 KB Output is correct
4 Correct 1 ms 512 KB Output is correct
5 Correct 1 ms 512 KB Output is correct
6 Correct 1 ms 512 KB Output is correct
7 Correct 1 ms 512 KB Output is correct
8 Incorrect 1 ms 640 KB 3rd lines differ - on the 1st token, expected: '0', found: '1'
9 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 268 ms 1408 KB Output is correct
2 Correct 288 ms 1408 KB Output is correct
3 Correct 287 ms 1372 KB Output is correct
4 Correct 54 ms 1152 KB Output is correct
5 Correct 267 ms 1352 KB Output is correct
6 Correct 913 ms 1528 KB Output is correct
7 Correct 49 ms 1408 KB Output is correct
8 Incorrect 264 ms 1420 KB 3rd lines differ - on the 27th token, expected: '1', found: '0'
9 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1314 ms 1272 KB Output is correct
2 Correct 166 ms 1280 KB Output is correct
3 Correct 105 ms 1408 KB Output is correct
4 Correct 49 ms 1408 KB Output is correct
5 Correct 333 ms 1420 KB Output is correct
6 Incorrect 396 ms 1408 KB 3rd lines differ - on the 1524th token, expected: '0', found: '1'
7 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 527 ms 1272 KB 3rd lines differ - on the 1st token, expected: '1', found: '0'
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 43 ms 896 KB Output is correct
2 Correct 43 ms 896 KB Output is correct
3 Correct 43 ms 896 KB Output is correct
4 Correct 45 ms 896 KB Output is correct
5 Correct 43 ms 896 KB Output is correct
6 Correct 45 ms 944 KB Output is correct
7 Correct 44 ms 1016 KB Output is correct
8 Correct 43 ms 896 KB Output is correct
9 Correct 43 ms 896 KB Output is correct
10 Correct 43 ms 896 KB Output is correct
11 Correct 42 ms 896 KB Output is correct
12 Correct 1 ms 512 KB Output is correct
13 Correct 1 ms 512 KB Output is correct
14 Correct 1 ms 512 KB Output is correct
15 Correct 1 ms 512 KB Output is correct
16 Correct 1 ms 512 KB Output is correct
17 Correct 1 ms 512 KB Output is correct
18 Correct 1 ms 512 KB Output is correct
19 Incorrect 1 ms 640 KB 3rd lines differ - on the 1st token, expected: '0', found: '1'
20 Halted 0 ms 0 KB -