oj.uz

답안 #1061261

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1061261 2024-08-16T07:34:48 Z vjudge1 장난감 기차 (IOI17_train) C++17
0 / 100
 99 ms 25748 KB 
// #include "train.h"
#include<bits/stdc++.h>

using namespace std;

const int N = 5000 + 10;
vector<int> G[N];
bool R[N], seen[N][N];
int n;

bool dfs(int v, int s)
{
  seen[v][s] = true;
  if(R[v]) return 1;

  bool ok = 0;
  for(int u : G[v])
    {
      if(seen[u][s]) continue;
      ok |= dfs(u, s);
    }
  return ok;
}

vector<int> Arezou()
{
  vector<int> w(n);
  for(int s = 0; s < n; s++)
    w[s] = dfs(s, s);
  return w;
}

vector<int> Borzou()
{
  vector<int> w(n);
  return w;
}


vector<int> who_wins(vector<int> a, vector<int> r, vector<int> u, vector<int> v)
{
  n = a.size();
  for(int i = 0; i < u.size(); i ++)
    G[u[i]].push_back(v[i]);
  

  for(int i = 0; i < n; i ++)
    R[i] = r[i];
  
  vector<int> w(n);
  int c = count(a.begin(), a.end(), 1);

  if(c == a.size())
    return Arezou();
  //if(c == 0)
  //return Borzou();

  for(int i = 0; i < n; i++)
    {
      int s = i;
      while(true)
	{
	  // do I have a cycle
	  bool cycle = false;
	  for(int c : G[s])
	    if(c == s) cycle = true;

	  if(cycle)
	    {
	      if(G[s].size() == 1)
		{
		  w[i] = r[s];
		  break;
		}
	      
	      if(r[s])
		{
		  if(a[s] == 1)
		    {
		      w[i] = 1;
		      break;
		    }
		  s++;
		  continue;
		}

	      if(a[s] == 1)
		{
		  s++;
		  continue;
		}
	      else
		{
		  w[i] = 0;
		  break;
		}
	    }
	  else
	    {
	      if(G[s].size())
		s++;
	      else
		{
		  w[i] = 0;
		  break;
		}
	    }
	}
    }
  return w;
}

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:43:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   43 |   for(int i = 0; i < u.size(); i ++)
      |                  ~~^~~~~~~~~~
train.cpp:53:8: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   53 |   if(c == a.size())
      |      ~~^~~~~~~~~~~

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 860 KB Output is correct
2 Correct 4 ms 860 KB Output is correct
3 Correct 2 ms 860 KB Output is correct
4 Correct 4 ms 860 KB Output is correct
5 Correct 2 ms 860 KB Output is correct
6 Correct 3 ms 860 KB Output is correct
7 Correct 2 ms 860 KB Output is correct
8 Incorrect 6 ms 23388 KB 3rd lines differ - on the 1st token, expected: '0', found: '1'
9 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

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

Subtask #3
0 / 11.0

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

Subtask #4
0 / 11.0

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

Subtask #5
0 / 12.0

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

Subtask #6
0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 860 KB Output is correct
2 Correct 4 ms 860 KB Output is correct
3 Correct 2 ms 860 KB Output is correct
4 Correct 4 ms 860 KB Output is correct
5 Correct 2 ms 860 KB Output is correct
6 Correct 3 ms 860 KB Output is correct
7 Correct 2 ms 860 KB Output is correct
8 Incorrect 6 ms 23388 KB 3rd lines differ - on the 1st token, expected: '0', found: '1'
9 Halted 0 ms 0 KB -