oj.uz

답안 #740955

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
740955 2023-05-13T10:25:39 Z dubabuba 게임 (APIO22_game) C++17
0 / 100
 14 ms 8476 KB 
#include "game.h"
#include <bits/stdc++.h>
using namespace std;

typedef pair<int, int> pii;
#define ff first
#define ss second
#define MP make_pair

const int mxn = 3e5 + 10;
vector<int> adj[mxn];
int n, k, vis[mxn];

bool dfs(int u) {
	vis[u] = 2;
	for(int v : adj[u]) {
		if(vis[v] == 2) return 1;
		bool e = 0;
		if(!vis[v])
			e = dfs(v);
		if(e) return 1;
	}
	vis[u] = 1;
	return 0;
}

void init(int n, int k) {
	::n = n;
	::k = k;
}

int add_teleporter(int u, int v) {
	adj[u].push_back(v);
	memset(vis, 0, sizeof vis);
	for(int i = 0; i < k; i++)
	if(dfs(i))
		return 1;
	return 0;
}

Subtask #1
0.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 8400 KB Output is correct
2 Correct 8 ms 8400 KB Output is correct
3 Correct 14 ms 8476 KB Output is correct
4 Incorrect 11 ms 8400 KB Wrong Answer[1]
5 Halted 0 ms 0 KB -

Subtask #2
0.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 8400 KB Output is correct
2 Correct 8 ms 8400 KB Output is correct
3 Correct 14 ms 8476 KB Output is correct
4 Incorrect 11 ms 8400 KB Wrong Answer[1]
5 Halted 0 ms 0 KB -

Subtask #3
0.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 8400 KB Output is correct
2 Correct 8 ms 8400 KB Output is correct
3 Correct 14 ms 8476 KB Output is correct
4 Incorrect 11 ms 8400 KB Wrong Answer[1]
5 Halted 0 ms 0 KB -

Subtask #4
0.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 8400 KB Output is correct
2 Correct 8 ms 8400 KB Output is correct
3 Correct 14 ms 8476 KB Output is correct
4 Incorrect 11 ms 8400 KB Wrong Answer[1]
5 Halted 0 ms 0 KB -

Subtask #5
0.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 8400 KB Output is correct
2 Correct 8 ms 8400 KB Output is correct
3 Correct 14 ms 8476 KB Output is correct
4 Incorrect 11 ms 8400 KB Wrong Answer[1]
5 Halted 0 ms 0 KB -