buggy_code stringlengths 11 625k | fixed_code stringlengths 17 625k | bug_type stringlengths 2 4.45k | language int64 0 8 | token_count int64 5 200k | change_count int64 0 100 |
|---|---|---|---|---|---|
n = int(input())
adj = [list(map(int, input().split()))[2:] for _ in range(n)]
d = [-1] * n
s = 1
q = []
d[s - 1] = 0
q.append(s)
while len(q):
u = q.pop()
v = adj[u - 1]
for vi in v:
if d[vi - 1] == -1:
d[vi - 1] = d[u - 1] + 1
elif d[vi - 1] > d[u - 1] + 1:
d[vi -... | n = int(input())
adj = [list(map(int, input().split()))[2:] for _ in range(n)]
d = [-1] * n
s = 1
q = []
d[s - 1] = 0
q.append(s)
while len(q):
u = q.pop()
v = adj[u - 1]
for vi in v:
if d[vi - 1] == -1:
d[vi - 1] = d[u - 1] + 1
q.append(vi)
elif d[vi - 1] ... | [["+", 64, 196, 0, 1, 0, 652, 63, 319, 500, 22], ["+", 64, 196, 0, 1, 0, 652, 63, 319, 0, 131], ["+", 64, 196, 0, 1, 0, 652, 63, 319, 319, 22], ["+", 64, 196, 0, 1, 0, 652, 3, 4, 0, 24], ["+", 64, 196, 0, 1, 0, 652, 3, 4, 0, 22], ["+", 64, 196, 0, 1, 0, 652, 3, 4, 0, 25]] | 5 | 175 | 6 |
import sys
n = eval(input())
d = [sys.maxsize for i in range(n + 1)]
Q = []
color = ['WHITE' for i in range(n + 1)]
graph_map = [[0 for j in range(n + 1)] for i in range(n + 1)]
for i in range(1, n + 1):
tmp = list(map(int, input().split()))
for j in range(tmp[1]):
graph_map[i][tmp[j + 2]] = 1
col... | n = eval(input())
d = [-1 for i in range(n + 1)]
Q = []
color = ['WHITE' for i in range(n + 1)]
graph_map = [[0 for j in range(n + 1)] for i in range(n + 1)]
for i in range(1, n + 1):
tmp = list(map(int, input().split()))
for j in range(tmp[1]):
graph_map[i][tmp[j + 2]] = 1
color[1] = 'GRAY'
d[1] =... | [["-", 36, 36, 36, 36, 0, 656, 0, 596, 0, 487], ["-", 36, 36, 0, 656, 0, 596, 141, 673, 0, 22], ["-", 0, 1, 0, 662, 12, 658, 8, 319, 500, 22], ["-", 0, 1, 0, 662, 12, 658, 8, 319, 0, 131], ["-", 0, 1, 0, 662, 12, 658, 8, 319, 319, 22], ["+", 0, 1, 0, 662, 12, 658, 8, 664, 17, 33], ["+", 0, 1, 0, 662, 12, 658, 8, 664, 2... | 5 | 253 | 7 |
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
using namespace std;
const int maxx = 110;
int n, m[maxx][maxx];
int u, num, v;
int flag[maxx];
int d[maxx];
void bfs() {
queue<int> q;
q.push(1);
d[1] = 0;
while (!q.empty()) {
int u = q.front();
q.pop();
for (int i = 1; i ... | #include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
using namespace std;
const int maxx = 110;
int n, m[maxx][maxx];
int u, num, v;
int flag[maxx];
int d[maxx];
void bfs() {
queue<int> q;
q.push(1);
d[1] = 0;
while (!q.empty()) {
int u = q.front();
q.pop();
for (int i = 2; i ... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 312 | 2 |
#include <cstdio>
#include <iostream>
#include <queue>
using namespace std;
const int Max = 100;
const int white = 0;
const int black = 1;
int M[Max][Max];
int d[Max], nt[Max], color[Max];
int n;
queue<int> Q;
int next(int u) {
for (int v = nt[u]; v < n; v++) {
nt[u] = v + 1;
if (M[u][v])
return v;
... | #include <cstdio>
#include <iostream>
#include <queue>
using namespace std;
const int Max = 100;
const int white = 0;
const int black = 1;
int M[Max][Max];
int d[Max], nt[Max], color[Max];
int n;
queue<int> Q;
int next(int u) {
for (int v = nt[u]; v < n; v++) {
nt[u] = v + 1;
if (M[u][v])
return v;
... | [["-", 0, 1, 0, 11, 31, 69, 341, 342, 0, 22], ["+", 0, 1, 0, 11, 31, 69, 341, 342, 0, 22]] | 1 | 400 | 2 |
#include <iostream>
#include <queue>
#include <unordered_map>
#include <vector>
using namespace std;
int main() {
int u, i, id, k, j;
cin >> u;
unordered_map<int, vector<int>> mymap;
queue<vector<int>> myqueue;
for (i = 0; i < u; ++i) {
cin >> id >> k;
vector<int> points;
for (j = 0; j < k; ++j) ... | #include <iostream>
#include <queue>
#include <unordered_map>
#include <vector>
using namespace std;
int main() {
int u, i, id, k, j;
cin >> u;
unordered_map<int, vector<int>> mymap;
queue<vector<int>> myqueue;
for (i = 0; i < u; ++i) {
cin >> id >> k;
vector<int> points;
for (j = 0; j < k; ++j) ... | [["-", 0, 1, 0, 11, 31, 69, 341, 342, 0, 22], ["+", 0, 1, 0, 11, 31, 69, 341, 342, 0, 22]] | 1 | 422 | 2 |
#include <cstring>
#include <iostream>
#include <queue>
using namespace std;
int k[1000][1000], n, a, b, c, t, x[1000];
queue<int> Q;
queue<int> R;
int main() {
memset(x, -1, sizeof(x));
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a >> b;
for (int j = 0; j < b; j++) {
cin >> c;
k[i][c] =... | #include <cstring>
#include <iostream>
#include <queue>
using namespace std;
int k[1000][1000], n, a, b, c, t, x[1000];
queue<int> Q;
queue<int> R;
int main() {
memset(x, -1, sizeof(x));
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a >> b;
for (int j = 0; j < b; j++) {
cin >> c;
k[i][c] =... | [["-", 12, 16, 31, 69, 28, 69, 341, 342, 0, 22], ["+", 28, 69, 341, 342, 0, 2, 63, 118, 28, 22], ["+", 28, 69, 341, 342, 0, 2, 63, 118, 17, 131], ["+", 28, 69, 341, 342, 0, 2, 63, 118, 119, 120], ["+", 28, 69, 341, 342, 0, 2, 3, 4, 0, 24], ["+", 28, 69, 341, 342, 0, 2, 3, 4, 0, 25], ["-", 51, 16, 12, 16, 31, 69, 341, 3... | 1 | 278 | 8 |
#include <iostream>
#include <queue>
using namespace std;
const long N = 100;
const long INFTY = (1 << 21);
long n, M[N + 1][N + 1];
long d[N + 1];
void bfs(long s) {
queue<long> q;
q.push(s);
for (long i = 1; i <= n; i++)
d[i] = INFTY;
d[s] = 0;
long u;
while (!q.empty()) {
u = q.front();
q.... | #include <iostream>
#include <queue>
using namespace std;
const long N = 100;
const long INFTY = (1 << 21);
long n, M[N + 1][N + 1];
long d[N + 1];
void bfs(long s) {
queue<long> q;
q.push(s);
for (long i = 1; i <= n; i++)
d[i] = INFTY;
d[s] = 0;
long u;
while (!q.empty()) {
u = q.front();
q.... | [["-", 0, 7, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 12, 22]] | 1 | 349 | 2 |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
const ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
const ... | [["-", 0, 57, 15, 339, 51, 16, 12, 16, 12, 22], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 12, 13], ["-", 8, 9, 0, 7, 8, 1, 0, 11, 12, 22], ["+", 8, 9, 0, 7, 8, 1, 0, 11, 12, 13], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13]] | 1 | 309 | 6 |
#include <iostream>
#include <queue>
using namespace std;
int main() {
int n, m, l, i, j, p;
int f[1000][1000];
int D[1000] = {};
cin >> n;
for (i = 0; i < n; i++) {
cin >> m;
cin >> p;
for (j = 0; j < p; j++) {
cin >> l;
f[m][l] = 1;
}
}
queue<int> Q;
Q.push(1);
while (!Q... | #include <iostream>
#include <queue>
using namespace std;
int main() {
int n, m, l, i, j, p;
int f[1000][1000];
int D[1000] = {};
cin >> n;
for (i = 0; i < n; i++) {
cin >> m;
cin >> p;
for (j = 0; j < p; j++) {
cin >> l;
f[m][l] = 1;
}
}
queue<int> Q;
Q.push(1);
while (!Q... | [["-", 0, 52, 8, 9, 0, 43, 49, 50, 49, 22], ["+", 0, 52, 8, 9, 0, 43, 49, 50, 49, 22], ["-", 0, 52, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 52, 8, 9, 0, 7, 10, 11, 12, 13], ["-", 31, 16, 31, 69, 28, 69, 341, 342, 0, 22], ["+", 31, 16, 31, 69, 28, 69, 341, 342, 0, 22], ["-", 0, 11, 12, 16, 31, 69, 341, 342, 0, 22], ["+", ... | 1 | 245 | 8 |
#include <iostream>
#include <queue>
using namespace std;
void debug1();
int n, gragh[110][110] = {}, d[110] = {};
queue<int> q;
int main() {
cin >> n;
// input
for (int i = 0; i < n; i++) {
int u, k;
cin >> u >> k;
for (int j = 0; j < k; j++) {
int t;
cin >> t;
gragh[u][t] = 1;
... | #include <iostream>
#include <queue>
using namespace std;
void debug1();
int n, gragh[110][110] = {}, d[110] = {};
queue<int> q;
int main() {
cin >> n;
// input
for (int i = 0; i < n; i++) {
int u, k;
cin >> u >> k;
for (int j = 0; j < k; j++) {
int t;
cin >> t;
gragh[u][t] = 1;
... | [["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 98], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 31, 22], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 79], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 12, 13]] | 1 | 335 | 4 |
#include <iostream>
#include <queue>
using namespace std;
static const int N = 100;
static const int no = -2;
int graph[N][N] = {{}};
int d[N] = {};
int n;
void bfs(int v) {
queue<int> Q;
Q.push(v);
int u;
for (int i = 1; i <= n; i++) {
d[i] = no;
}
d[v] = 0;
while (!Q.empty()) {
u = Q.front... | #include <iostream>
#include <queue>
using namespace std;
static const int N = 100;
static const int no = -1;
int graph[N][N] = {{}};
int d[N] = {};
int n;
void bfs(int v) {
queue<int> Q;
Q.push(v);
int u;
for (int i = 1; i <= n; i++) {
d[i] = no;
}
d[v] = 0;
while (!Q.empty()) {
u = Q.front... | [["-", 36, 36, 0, 30, 0, 43, 49, 50, 51, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 50, 51, 13]] | 1 | 296 | 2 |
#include <cstdio>
#include <iostream>
#include <queue>
using namespace std;
static const int MAX_NUM = 101;
void BFS(int matrix[][MAX_NUM], int num, int target, int result[]) {
queue<int> Q;
int distance = 0;
char state[MAX_NUM] = {0};
Q.push(target);
result[target] = distance;
state[target] = 1;
whil... | #include <cstdio>
#include <iostream>
#include <queue>
using namespace std;
static const int MAX_NUM = 101;
void BFS(int matrix[][MAX_NUM], int num, int target, int result[]) {
queue<int> Q;
int distance = 0;
char state[MAX_NUM] = {0};
Q.push(target);
result[target] = distance;
state[target] = 1;
whil... | [["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 72], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 1 | 346 | 2 |
#include <iostream>
#include <queue>
using namespace std;
int G[100][100];
int d[100];
int color[100];
int n;
queue<int> qu;
void bfs() {
color[0] = 1;
d[0] = 0;
qu.push(0);
while (!qu.empty()) {
int u = qu.front();
qu.pop();
for (int i = 0; i < n; i++) {
if (G[u][i] == 1 && color[i] == 0) {
... | #include <iostream>
#include <queue>
using namespace std;
int G[100][100];
int d[100];
int color[100];
int n;
queue<int> qu;
void bfs() {
color[0] = 1;
d[0] = 0;
qu.push(0);
while (!qu.empty()) {
int u = qu.front();
qu.pop();
for (int i = 0; i < n; i++) {
if (G[u][i] == 1 && color[i] == 0) {
... | [["+", 0, 16, 31, 16, 31, 16, 12, 5, 0, 62], ["+", 0, 16, 31, 16, 31, 16, 12, 5, 0, 6], ["+", 8, 9, 0, 1, 0, 16, 31, 16, 17, 151]] | 1 | 344 | 4 |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long lli;
typedef vector<lli> vll;
typedef vector<bool> vbl;
typedef vector<vector<lli>> mat;... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long lli;
typedef vector<lli> vll;
typedef vector<bool> vbl;
typedef vector<vector<lli>> mat;... | [["+", 0, 1, 0, 11, 12, 2, 3, 4, 0, 21], ["+", 0, 1, 0, 11, 12, 2, 3, 4, 0, 13]] | 1 | 379 | 2 |
#include <iostream>
using namespace std;
#define N_MAX 100
int Adj[N_MAX][N_MAX] = {};
int Min_d[N_MAX];
void bfs(int v, int d, int num_node);
int main() {
int n, i, u, k, v, j;
cin >> n;
for (i = 0; i < n; i++)
Min_d[i] = -1;
//??£??\???????????????
for (i = 0; i < n; i++) {
cin >> u >> k;
... | #include <iostream>
using namespace std;
#define N_MAX 100
int Adj[N_MAX][N_MAX] = {};
int Min_d[N_MAX];
void bfs(int v, int d, int num_node);
int main() {
int n, i, u, k, v, j;
cin >> n;
for (i = 0; i < n; i++)
Min_d[i] = -1;
//??£??\???????????????
for (i = 0; i < n; i++) {
cin >> u >> k;
... | [["+", 0, 57, 64, 9, 0, 57, 64, 9, 0, 45], ["+", 0, 57, 64, 9, 0, 57, 64, 9, 0, 46]] | 1 | 277 | 2 |
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
int main() {
int n;
vector<int> mat[100];
cin >> n;
for (int i = 0; i < n; i++) {
int u, k;
cin >> u >> k;
for (int j = 0; j < k; j++) {
int v;
cin >> v;
mat[i].push_back(v);
}
}
int d[100];
fo... |
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
int main() {
int n;
vector<int> mat[100];
cin >> n;
for (int i = 0; i < n; i++) {
int u, k;
cin >> u >> k;
for (int j = 0; j < k; j++) {
int v;
cin >> v;
mat[i].push_back(v - 1);
}
}
int d[100];
... | [["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 33], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]] | 1 | 272 | 2 |
def dfs():
tt = 0
for u in range(N):
if colors[u] == WHITE:
dfs_visit(u, tt)
def dfs_visit(u, tt):
tt += 1
colors[u] = GLAY
d[u] = tt
for v in range(N):
if adjacency_list[u][v] == 1 and colors[v] == WHITE:
tt = dfs_visit(v, tt)
tt += 1
colors[u] =... | def dfs():
tt = 0
for u in range(N):
if colors[u] == WHITE:
tt = dfs_visit(u, tt)
def dfs_visit(u, tt):
tt += 1
colors[u] = GLAY
d[u] = tt
for v in range(N):
if adjacency_list[u][v] == 1 and colors[v] == WHITE:
tt = dfs_visit(v, tt)
tt += 1
colors... | [["+", 0, 57, 64, 196, 0, 1, 0, 662, 31, 22], ["+", 0, 57, 64, 196, 0, 1, 0, 662, 0, 32]] | 5 | 257 | 2 |
def depth_search(u, t):
t += 1
s.append(u)
d[u] = t
for v in range(N):
if adjacency_list[u][v] == 0:
continue
if d[v] == 0 and v not in s:
t = depth_search(v, t)
t += 1
s.pop()
f[u] = t
return t
N = int(input())
adjacency_list = [[0 for j in rang... | def depth_search(u, t):
t += 1
s.append(u)
d[u] = t
for v in range(N):
if adjacency_list[u][v] == 0:
continue
if d[v] == 0 and v not in s:
t = depth_search(v, t)
t += 1
s.pop()
f[u] = t
return t
N = int(input())
adjacency_list = [[0 for j in rang... | [["-", 8, 196, 0, 57, 15, 666, 0, 206, 206, 612], ["+", 8, 196, 0, 57, 15, 666, 0, 206, 206, 22]] | 5 | 241 | 2 |
#coding: utf-8
n = int(input())
color = ["white" for i in range(n)]
d = [[] for i in range(n)]
global t
t = 0
M = [[False for i in range(n)] for j in range(n)]
for i in range(n):
data = list(map(int,input().split()))
u = data[0]
k = data[1]
if i == 0:
start = u
for v in data[2:2+k]:
... | #coding: utf-8
n = int(input())
color = ["white" for i in range(n)]
d = [[] for i in range(n)]
global t
t = 0
M = [[False for i in range(n)] for j in range(n)]
for i in range(n):
data = list(map(int,input().split()))
u = data[0]
k = data[1]
if i == 0:
start = u
for v in data[2:2+k]:
... | [["+", 8, 196, 0, 7, 12, 652, 3, 4, 0, 612], ["+", 8, 196, 0, 7, 12, 652, 3, 4, 0, 21], ["+", 0, 7, 12, 652, 3, 4, 0, 657, 17, 72], ["+", 0, 7, 12, 652, 3, 4, 0, 657, 12, 612]] | 5 | 300 | 4 |
n = int(input())
A = [[0 for i in range(n)] for j in range(n)]
for i in range(n):
u, k, *v = list(map(int, input().split()))
for j in v:
A[int(u)-1][int(j)-1] = 1
# A[int(j)-1][int(u)-1] = 1
# for row in A:
# msg = ' '.join(map(str, row))
# # print(msg)
d = [-1] * n
f = [-1] * n
t = ... | n = int(input())
A = [[0 for i in range(n)] for j in range(n)]
for i in range(n):
u, k, *v = list(map(int, input().split()))
for j in v:
A[int(u)-1][int(j)-1] = 1
# A[int(j)-1][int(u)-1] = 1
# for row in A:
# msg = ' '.join(map(str, row))
# # print(msg)
d = [-1] * n
f = [-1] * n
t = ... | [["-", 0, 57, 15, 666, 0, 206, 206, 657, 17, 33], ["-", 0, 57, 15, 666, 0, 206, 206, 657, 12, 612], ["-", 0, 1, 0, 652, 3, 4, 0, 657, 17, 33], ["-", 0, 1, 0, 652, 3, 4, 0, 657, 12, 612]] | 5 | 229 | 4 |
n = int(input())
A = [[0 for i in range(n)] for j in range(n)]
for i in range(n):
u, k, *v = list(map(int, input().split()))
for j in v:
A[int(u)-1][int(j)-1] = 1
# A[int(j)-1][int(u)-1] = 1
for row in A:
msg = ' '.join(map(str, row))
# print(msg)
d = [-1] * n
f = [-1] * n
t = 0
# #... | n = int(input())
A = [[0 for i in range(n)] for j in range(n)]
for i in range(n):
u, k, *v = list(map(int, input().split()))
for j in v:
A[int(u)-1][int(j)-1] = 1
# A[int(j)-1][int(u)-1] = 1
for row in A:
msg = ' '.join(map(str, row))
# print(msg)
d = [-1] * n
f = [-1] * n
t = 0
# #... | [["+", 3, 4, 0, 652, 3, 4, 0, 657, 17, 72], ["+", 3, 4, 0, 652, 3, 4, 0, 657, 12, 612]] | 5 | 360 | 2 |
def depth(s, time):
time += 1
flag[s] = 1
d[s] = t
for i in range(1, n+1):
if G[s][i] == 1:
if flag[i] == 0:
depth(i, time)
t = f[i]
f[s] = time + 1
n = int(input())
G = [[0 for i in range(n+1)] for j in range(n+1)]
d = [0 for i in range(n+1)]
f ... | def depth(s, time):
time += 1
flag[s] = 1
d[s] = time
for i in range(1, n+1):
if G[s][i] == 1:
if flag[i] == 0:
depth(i, time)
time = f[i]
f[s] = time + 1
n = int(input())
G = [[0 for i in range(n+1)] for j in range(n+1)]
d = [0 for i in range(n+... | [["-", 0, 14, 8, 196, 0, 1, 0, 662, 12, 22], ["+", 0, 14, 8, 196, 0, 1, 0, 662, 12, 22], ["-", 0, 57, 64, 196, 0, 1, 0, 662, 31, 22], ["+", 0, 57, 64, 196, 0, 1, 0, 662, 31, 22]] | 5 | 276 | 4 |
import sys
def dfs(i, t, l, a, b):
t += 1
a[i] = t
for j in l[i]:
if not a[j-1]:
t = dfs(j-1, t, l, a, b)
t += 1
b[i] = t
return t
n = eval(input())
l=[]
for i in range(n):
l.append([int(s) for s in sys.stdin.readline().split()[2:]])
a = [0] * n
b = [0] * n
t = 0
for i in range... | import sys
def dfs(i, t, l, a, b):
t += 1
a[i] = t
for j in l[i]:
if not a[j-1]:
t = dfs(j-1, t, l, a, b)
t += 1
b[i] = t
return t
n = eval(input())
l=[]
for i in range(n):
l.append([int(s) for s in sys.stdin.readline().split()[2:]])
a = [0] * n
b = [0] * n
t = 0
for i in ra... | [["-", 0, 57, 64, 196, 0, 1, 0, 662, 31, 22], ["+", 0, 57, 64, 196, 0, 1, 0, 662, 31, 22]] | 5 | 188 | 2 |
n = int(input())
d = [0 for i in range(n)]
f = [0 for i in range(n)]
a = [[0 for i in range(n)] for j in range(n)]
st = [0 for i in range(n)]
time = [0]
g = [0 for i in range(n)]
def dfs_visit(s):
st[s] = 1
time[0] += 1
d[s] = time[0]
for k in range(n):
if a[s][k] == 1 and st[k] == 0... | n = int(input())
d = [0 for i in range(n)]
f = [0 for i in range(n)]
a = [[0 for i in range(n)] for j in range(n)]
st = [0 for i in range(n)]
time = [0]
g = [0 for i in range(n)]
def dfs_visit(s):
st[s] = 1
time[0] += 1
d[s] = time[0]
for k in range(n):
if a[s][k] == 1 and st[k] == 0... | [["-", 0, 7, 8, 196, 0, 1, 0, 662, 31, 22], ["+", 0, 7, 8, 196, 0, 1, 0, 662, 31, 22], ["-", 31, 206, 51, 206, 206, 657, 31, 206, 51, 22], ["+", 31, 206, 51, 206, 206, 657, 31, 206, 51, 22], ["+", 36, 36, 0, 656, 0, 1, 0, 652, 63, 22], ["+", 0, 656, 0, 1, 0, 652, 3, 4, 0, 24], ["+", 0, 656, 0, 1, 0, 652, 3, 4, 0, 25]] | 5 | 273 | 7 |
n=0
m=eval(input())
c=[0 for i in range(m)]
t=[0 for i in range(m)]
def d(u):
global n
if ts[u]:return
n = n + 1
ts[u]=[u+1,n]
for i in c[u]:d(i-1)
n = n + 1
ts[u][2:]=[n]
def dfs():
for i in range(m):
l=list(map(int,input().split()))
c[l[0]-1]=l[2:]
for i in range(m):
... | n=0
m=eval(input())
c=[0 for i in range(m)]
ts=[0 for i in range(m)]
def d(u):
global n
if ts[u]:return
n = n + 1
ts[u]=[u+1,n]
for i in c[u]:d(i-1)
n = n + 1
ts[u][2:]=[n]
def dfs():
for i in range(m):
l=list(map(int,input().split()))
c[l[0]-1]=l[2:]
for i in range(m):
... | [["-", 36, 36, 0, 656, 0, 1, 0, 662, 31, 22], ["+", 36, 36, 0, 656, 0, 1, 0, 662, 31, 22]] | 5 | 177 | 2 |
def dfs(v, cnt):
D[v] = cnt
cnt += 1
for c in edge[v]:
if D[c] == -1:
cnt = dfs(c, cnt)
F[v] = cnt
cnt += 1
return cnt
V = int(input())
edge = [[] for _ in range(V)]
for _ in range(V):
u, _, *v = map(lambda x: int(x)-1, input().split())
edge[u] = sorted(v)
D, F = [-... | def dfs(v, cnt):
D[v] = cnt
cnt += 1
for c in edge[v]:
if D[c] == -1:
cnt = dfs(c, cnt)
F[v] = cnt
cnt += 1
return cnt
V = int(input())
edge = [[] for _ in range(V)]
for _ in range(V):
u, _, *v = map(lambda x: int(x)-1, input().split())
edge[u] = sorted(v)
D, F = [-... | [["+", 0, 1, 0, 652, 3, 4, 0, 657, 17, 72], ["+", 0, 1, 0, 652, 3, 4, 0, 657, 12, 612]] | 5 | 190 | 2 |
def dfs_recursive(u):
global time
color[u] = 'gray'
arrive[u] = time
time += 1
for v in range(n):
if adjMat[u][v] == 1 and color[v] == 'white':
dfs_recursive(v)
color[u] = 'black'
finish[u] = time
time += 1
n = int(input())
adjMat = [[0] * n for _ in range(n)]
colo... | def dfs_recursive(u):
global time
color[u] = 'gray'
arrive[u] = time
time += 1
for v in range(n):
if adjMat[u][v] == 1 and color[v] == 'white':
dfs_recursive(v)
color[u] = 'black'
finish[u] = time
time += 1
n = int(input())
adjMat = [[0] * n for _ in range(n)]
colo... | [["-", 0, 57, 64, 196, 0, 1, 0, 652, 63, 22], ["+", 0, 57, 64, 196, 0, 1, 0, 652, 63, 22]] | 5 | 240 | 2 |
n=int(input())
#V[u]=[k,[v],d,f]
V=[[0,[],0,0]]
for i in range(n):
v=[int(i) for i in input().split(" ")]
u=v.pop(0)
k=v.pop(0)
v.sort()
V.append([k,v,0,0])
def is_finished(Id):
k=V[Id][0]
v=V[Id][1]
for i in range(k):
if V[v[i]][2]==0:
return v[i]
return -1
ti... | n=int(input())
#V[u]=[k,[v],d,f]
V=[[0,[],0,0]]
for i in range(n):
v=[int(i) for i in input().split(" ")]
u=v.pop(0)
k=v.pop(0)
v.sort()
V.append([k,v,0,0])
def is_finished(Id):
k=V[Id][0]
v=V[Id][1]
for i in range(k):
if V[v[i]][2]==0:
return v[i]
return -1
ti... | [["-", 0, 7, 8, 196, 0, 1, 0, 652, 63, 22], ["-", 8, 196, 0, 1, 0, 652, 3, 4, 0, 24], ["-", 8, 196, 0, 1, 0, 652, 3, 4, 0, 22], ["-", 8, 196, 0, 1, 0, 652, 3, 4, 0, 25]] | 5 | 333 | 4 |
# -*- coding: utf-8 -*-
def DFS_stack(adj, start):
n = len(adj)
d = [0] * n
f = [0] * n
flag = [0] * n # 0:????¨????, 1:?¨??????????, 2:?¨??????????
S = []
time = 1
S.append(start)
flag[start] = 1
d[start] = time
time = time + 1
while flag.count(2) != n: # ??¨?????????... | # -*- coding: utf-8 -*-
def DFS_stack(adj, start):
n = len(adj)
d = [0] * n
f = [0] * n
flag = [0] * n # 0:????¨????, 1:?¨??????????, 2:?¨??????????
S = []
time = 1
S.append(start)
flag[start] = 1
d[start] = time
time = time + 1
while flag.count(2) != n: # ??¨?????????... | [["+", 0, 14, 8, 196, 0, 1, 0, 662, 31, 22], ["+", 0, 14, 8, 196, 0, 1, 0, 662, 0, 32], ["+", 0, 57, 64, 196, 0, 1, 0, 662, 31, 22], ["+", 0, 57, 64, 196, 0, 1, 0, 662, 0, 32]] | 5 | 537 | 4 |
j = 1
def dfs(graph, start, result, visited=None):
global j
if visited == None:
visited = []
visited.append(start)
result[start][1] = j
for next in graph[start][2:]:
if next in visited:
continue
j += 1
dfs(graph, next, result, visited)
else:
... | j = 1
def dfs(graph, start, result, visited=None):
global j
if visited == None:
visited = []
visited.append(start)
result[start][1] = j
for next in graph[start][2:]:
if next in visited:
continue
j += 1
dfs(graph, next, result, visited)
else:
... | [["+", 0, 7, 8, 196, 0, 1, 0, 677, 31, 22], ["+", 0, 7, 8, 196, 0, 1, 0, 677, 17, 107], ["+", 0, 7, 8, 196, 0, 1, 0, 677, 12, 612]] | 5 | 202 | 3 |
n = int(input())
a = [[0]*n for i in range(n)]
for i in range(n):
v = list(map(int, input().split()))
u = v[0]
k = v[1]
for j in range(k):
a[u - 1][v[2 + j] - 1] = 1
d = [0] * n
f = [0] * n
isDiscovered = [False] * n
time_stamp = 0
def dfs(x):
global time_stamp
isDiscovered [x] = Tr... | n = int(input())
a = [[0]*n for i in range(n)]
for i in range(n):
v = list(map(int, input().split()))
u = v[0]
k = v[1]
for j in range(k):
a[u - 1][v[2 + j] - 1] = 1
d = [0] * n
f = [0] * n
isDiscovered = [False] * n
time_stamp = 0
def dfs(x):
global time_stamp
isDiscovered [x] = Tr... | [["-", 36, 36, 0, 656, 0, 7, 12, 652, 63, 22], ["+", 36, 36, 0, 656, 0, 7, 12, 652, 63, 22]] | 5 | 221 | 14 |
class Color(Enum):
WHITE = auto() # 未訪問の頂点
GRAY = auto() # 訪問済みだが, 全ての接点の調査は済んでいない状態の接点
BLACK = auto() # 訪問, 調査済みの接点
n = int(input())
d = [0 for i in range(n)]
f = [0 for i in range(n)]
colors = [] # 頂点の訪問状態
A = [[0 for j in range(n)] for i in range(n)] # 隣接行列
# stack = [] ## スタックによる実装では頂点の保持が必要 => 再帰によって... | from enum import Enum, auto
class Color(Enum):
WHITE = auto() # 未訪問の頂点
GRAY = auto() # 訪問済みだが, 全ての接点の調査は済んでいない状態の接点
BLACK = auto() # 訪問, 調査済みの接点
n = int(input())
d = [0 for i in range(n)]
f = [0 for i in range(n)]
colors = [] # 頂点の訪問状態
A = [[0 for j in range(n)] for i in range(n)] # 隣接行列
# stack = [] ## ... | [["+", 36, 36, 36, 36, 0, 656, 0, 686, 0, 314], ["+", 36, 36, 0, 656, 0, 686, 687, 673, 0, 22], ["+", 36, 36, 36, 36, 0, 656, 0, 686, 0, 487], ["+", 36, 36, 0, 656, 0, 686, 141, 673, 0, 22], ["+", 36, 36, 36, 36, 0, 656, 0, 686, 0, 21]] | 5 | 310 | 6 |
time=1
n=int(input())
A=[[] for i in range(n)]
d=[0 for i in range(n)]
f=[0 for i in range(n)]
for i in range(n):
a=list(map(int,input().split()))
for j in range(a[1]):
A[i].append(a[2+j]-1)
def dfs(q,num):
global d,f,time
d[num]=time
for nx in q[num]:
if d[nx]==0:
time+=1
dfs(q,nx)
time+=1
f[num]=t... | time=1
n=int(input())
A=[[] for i in range(n)]
d=[0 for i in range(n)]
f=[0 for i in range(n)]
for i in range(n):
a=list(map(int,input().split()))
for j in range(a[1]):
A[i].append(a[2+j]-1)
def dfs(q,num):
global d,f,time
d[num]=time
for nx in q[num]:
if d[nx]==0:
time+=1
dfs(q,nx)
time+=1
f[num]=t... | [["+", 0, 57, 64, 196, 0, 1, 0, 677, 31, 22], ["+", 0, 57, 64, 196, 0, 1, 0, 677, 17, 107], ["+", 0, 57, 64, 196, 0, 1, 0, 677, 12, 612]] | 5 | 201 | 3 |
nn = int(input())
dis = [99999 for i in range(n)]
G = [0 for i in range(n)]
v = [[0 for i in range(n)] for j in range(n)]
def BFS(s):
for e in range(n):
if v[s][e] == 1:
if dis[e] > dis[s] + 1:
d[e] = d[s]+1
BFS(e)
for i in range(n):
G = list(map(int, input().split()))
for j ... | n = int(input())
dis = [99999 for i in range(n)]
G = [0 for i in range(n)]
v = [[0 for i in range(n)] for j in range(n)]
def BFS(s):
for e in range(n):
if v[s][e] == 1:
if dis[e] > dis[s] + 1:
dis[e] = dis[s]+1
BFS(e)
for i in range(n):
G = list(map(int, input().split()))
for... | [["-", 36, 36, 0, 656, 0, 1, 0, 662, 31, 22], ["+", 36, 36, 0, 656, 0, 1, 0, 662, 31, 22], ["-", 64, 196, 0, 1, 0, 662, 31, 206, 51, 22], ["+", 64, 196, 0, 1, 0, 662, 31, 206, 51, 22], ["-", 0, 1, 0, 662, 12, 657, 31, 206, 51, 22], ["+", 0, 1, 0, 662, 12, 657, 31, 206, 51, 22]] | 5 | 230 | 6 |
from collections import deque
n = int(input())
M = [[0]*n for _ in range(n)]
color = [0] * n
WHITE = 0
GRAY = 1
BLACK = 2
d = [float('inf')] * n
Q = deque([])
def bfs():
color[0] = GRAY
d[0] = 0
Q.append(0)
while len(Q) > 0:
u = Q.popleft()
for v in range(n):
if M[u][v] == ... | from collections import deque
n = int(input())
M = [[0]*n for _ in range(n)]
color = [0] * n
WHITE = 0
GRAY = 1
BLACK = 2
d = [-1] * n
Q = deque([])
def bfs():
color[0] = GRAY
d[0] = 0
Q.append(0)
while len(Q) > 0:
u = Q.popleft()
for v in range(n):
if M[u][v] == 1 and colo... | [["-", 0, 662, 12, 657, 31, 634, 0, 652, 63, 22], ["-", 12, 657, 31, 634, 0, 652, 3, 4, 0, 24], ["-", 31, 634, 0, 652, 3, 4, 0, 557, 0, 654], ["-", 31, 634, 0, 652, 3, 4, 0, 557, 0, 6], ["-", 31, 634, 0, 652, 3, 4, 0, 557, 0, 655], ["-", 12, 657, 31, 634, 0, 652, 3, 4, 0, 25], ["+", 0, 662, 12, 657, 31, 634, 0, 664, 17... | 5 | 262 | 8 |
#!/usr/bin/env python
# -*- coding: utf-8 -*-
import sys
from collections import deque
UNVISITED, VISITED_IN_QUEUE, POPPED_OUT = 0, 1, 2
def generate_adj_matrix(v_info):
for v_detail in v_info:
v_adj_list = v_detail[2:]
# assert len(v_adj_list) == int(v_detail[1])
for each in v_adj_list:... | #!/usr/bin/env python
# -*- coding: utf-8 -*-
import sys
from collections import deque
UNVISITED, VISITED_IN_QUEUE, POPPED_OUT = 0, 1, 2
def generate_adj_matrix(v_info):
for v_detail in v_info:
v_adj_list = v_detail[2:]
# assert len(v_adj_list) == int(v_detail[1])
for each in v_adj_list:... | [["-", 64, 196, 0, 1, 0, 652, 63, 319, 319, 22], ["+", 64, 196, 0, 1, 0, 652, 63, 319, 319, 22], ["-", 0, 1, 0, 662, 12, 657, 31, 634, 0, 612], ["+", 0, 662, 12, 657, 31, 634, 0, 664, 17, 33], ["+", 0, 662, 12, 657, 31, 634, 0, 664, 28, 612]] | 5 | 296 | 5 |
# -*- coding: utf-8 -*-
import sys
import os
import math
N = int(input())
E = []
E.append([])
d = [None] * (N + 1)
for i in range(N):
lst = list(map(int, input().split()))
nodes = lst[2:]
E.append(nodes)
#print(E)
q = []
q.append(1)
visited = [False] * (N + 1)
d[1] = 0
visited[1] = True
while q:
... | # -*- coding: utf-8 -*-
import sys
import os
import math
N = int(input())
E = []
E.append([])
d = [-1] * (N + 1)
for i in range(N):
lst = list(map(int, input().split()))
nodes = lst[2:]
E.append(nodes)
#print(E)
q = []
q.append(1)
visited = [False] * (N + 1)
d[1] = 0
visited[1] = True
while q:
i... | [["-", 0, 1, 0, 662, 12, 657, 31, 634, 0, 685], ["+", 0, 662, 12, 657, 31, 634, 0, 664, 17, 33], ["+", 0, 662, 12, 657, 31, 634, 0, 664, 28, 612]] | 5 | 181 | 3 |
# -*- coding: utf-8 -*-
from collections import deque
N = int(input())
adj = [[0]*N for _ in range(N)]
unsearched = set(range(N))
result = {n:-1 for n in range(N)}
for n in range(N):
inp = list(map(int, input().split()))
for i in inp[2:]:
adj[inp[0]-1][i-1] = 1
que = deque([[0, 0]]) # edge distance
... | # -*- coding: utf-8 -*-
from collections import deque
N = int(input())
adj = [[0]*N for _ in range(N)]
unsearched = set(range(1, N))
result = {n:-1 for n in range(N)}
for n in range(N):
inp = list(map(int, input().split()))
for i in inp[2:]:
adj[inp[0]-1][i-1] = 1
que = deque([[0, 0]]) # edge distanc... | [["+", 12, 652, 3, 4, 0, 652, 3, 4, 0, 612], ["+", 12, 652, 3, 4, 0, 652, 3, 4, 0, 21]] | 5 | 231 | 2 |
# -*- coding: utf-8 -*-
from collections import deque
if __name__ == '__main__':
n = int(input())
M = [[0 for i in range(n)] for j in range(n)]
for _ in range(n):
l = list(map(int, input().split(" ")))
u = l[0]
k = l[1]
if k != 0:
for v in l[2:]:
... | # -*- coding: utf-8 -*-
from collections import deque
if __name__ == '__main__':
n = int(input())
M = [[0 for i in range(n)] for j in range(n)]
for _ in range(n):
l = list(map(int, input().split(" ")))
u = l[0]
k = l[1]
if k != 0:
for v in l[2:]:
... | [["-", 0, 662, 12, 657, 31, 634, 0, 652, 63, 22], ["-", 12, 657, 31, 634, 0, 652, 3, 4, 0, 24], ["-", 31, 634, 0, 652, 3, 4, 0, 557, 0, 654], ["-", 31, 634, 0, 652, 3, 4, 0, 557, 0, 6], ["-", 31, 634, 0, 652, 3, 4, 0, 557, 0, 655], ["-", 12, 657, 31, 634, 0, 652, 3, 4, 0, 25], ["+", 0, 662, 12, 657, 31, 634, 0, 664, 17... | 5 | 250 | 8 |
from collections import deque
from enum import Enum, auto
class Color(Enum):
WHITE = auto()
GRAY = auto()
BLACK = auto()
n = int(input())
d = [0 for i in range(n)]
f = [0 for i in range(n)]
colors = [] # 頂点の訪問状態
A = [[0 for j in range(n)] for i in range(n)] # 隣接行列
queue = deque([])
# 隣接行列の初期化
for i in r... | from collections import deque
from enum import Enum, auto
class Color(Enum):
WHITE = auto()
GRAY = auto()
BLACK = auto()
n = int(input())
d = [0 for i in range(n)]
f = [0 for i in range(n)]
colors = [] # 頂点の訪問状態
A = [[0 for j in range(n)] for i in range(n)] # 隣接行列
queue = deque([])
# 隣接行列の初期化
for i in r... | [["-", 0, 1, 0, 662, 12, 652, 63, 319, 319, 22], ["+", 0, 1, 0, 662, 12, 652, 63, 319, 319, 22], ["-", 0, 57, 64, 196, 0, 1, 0, 666, 667, 60], ["+", 0, 57, 64, 196, 0, 1, 0, 662, 0, 32]] | 5 | 328 | 4 |
config = {
input : 'tmp',
newline : '\r\n'
}; // win
// config = { input: '/dev/stdin', newline: '\n' }; // linux
line = require('fs')
.readFileSync(config.input, 'ascii')
.trim()
.split(config.newline)
.map(function(line) { return line.split(' ').map(Number); });
n = l... | // config = { input: 'tmp', newline: '\r\n' }; // win
config = {
input : '/dev/stdin',
newline : '\n'
}; // linux
line = require('fs')
.readFileSync(config.input, 'ascii')
.trim()
.split(config.newline)
.map(function(line) { return line.split(' ').map(Number); });
n = l... | [["-", 0, 11, 12, 500, 0, 569, 51, 557, 0, 491], ["+", 0, 11, 12, 500, 0, 569, 51, 557, 0, 491], ["-", 0, 11, 12, 500, 0, 569, 51, 557, 0, 44]] | 2 | 456 | 3 |
#include <stdio.h>
#define N 100000
int ID[N] = {0};
void def() {
int i;
for (i = 0; i < N; ++i) {
ID[i] = i;
}
}
int find(int a) {
if (a == ID[a]) {
return a;
}
return ID[a] = find(ID[a]);
}
int Judge(int a, int b) {
if (find(a) == find(b))
return 1;
else
return 0;
}
void unite(int... | #include <stdio.h>
#define N 100000
int ID[N] = {0};
void def() {
int i;
for (i = 0; i < N; ++i) {
ID[i] = i;
}
}
int find(int a) {
if (a == ID[a]) {
return a;
}
return ID[a] = find(ID[a]);
}
int Judge(int a, int b) {
if (find(a) == find(b))
return 1;
else
return 0;
}
void unite(int... | [["+", 0, 14, 8, 9, 0, 1, 0, 2, 63, 22], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 25], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35]] | 0 | 292 | 4 |
#include <stdio.h>
#define N 100000
int a[N] = {};
int search(int c) {
if (c == a[c])
return c;
return a[c] = search(a[c]);
}
int main(void) {
int i, n, m, q, s, t;
for (i = 0; i < N; i++)
a[i] = i;
scanf("%d %d", &n, &m);
for (i = 0; i < m; i++) {
scanf("%d %d", &s, &t);
if (search... | #include <stdio.h>
#define N 100000
int a[N] = {};
int search(int c) {
if (c == a[c])
return c;
return a[c] = search(a[c]);
}
int main(void) {
int i, n, m, q, s, t;
for (i = 0; i < N; i++)
a[i] = i;
scanf("%d %d", &n, &m);
for (i = 0; i < m; i++) {
scanf("%d %d", &s, &t);
if (search(s... | [["+", 64, 1, 0, 11, 31, 69, 71, 2, 63, 22], ["+", 0, 11, 31, 69, 71, 2, 3, 4, 0, 24], ["+", 0, 11, 31, 69, 71, 2, 3, 4, 0, 25], ["+", 0, 57, 64, 1, 0, 11, 12, 2, 63, 22], ["+", 64, 1, 0, 11, 12, 2, 3, 4, 0, 24], ["+", 64, 1, 0, 11, 12, 2, 3, 4, 0, 25]] | 0 | 218 | 6 |
#include <stdio.h>
static const int MAX = 500;
static const int INFTY = (1 << 21);
main() {
int n, i, j, e, sum;
/*
*/
int cost[MAX];
int M[MAX][MAX];
int p[MAX];
int VI[MAX];
int mn;
int tmp;
scanf("%d", &n);
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) {
scanf("%d", &e);
... | #include <stdio.h>
static const int MAX = 500;
static const int INFTY = (1 << 21);
main() {
int n, i, j, e, sum;
/*
*/
int cost[MAX];
int M[MAX][MAX];
int p[MAX];
int VI[MAX];
int mn;
int tmp;
scanf("%d", &n);
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) {
scanf("%d", &e);
... | [["-", 0, 30, 0, 9, 0, 7, 15, 16, 17, 47], ["+", 0, 30, 0, 9, 0, 7, 15, 16, 17, 18]] | 0 | 366 | 2 |
#include <stdio.h>
#define NIL -1
static const int MAX = 500;
static const int INFTY = (1 << 21);
main() {
int n, i, j, e, sum;
int min = INFTY, u, v;
int M[MAX][MAX], visit[MAX], c[MAX], p[MAX];
scanf("%d", &n);
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) {
scanf("%d", &e);
M[i][j] ... | #include <stdio.h>
#define NIL -1
static const int MAX = 500;
static const int INFTY = (1 << 21);
main() {
int n, i, j, e, sum;
int min = INFTY, u, v;
int M[MAX][MAX], visit[MAX], c[MAX], p[MAX];
scanf("%d", &n);
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) {
scanf("%d", &e);
M[i][j] ... | [["-", 8, 9, 0, 57, 15, 23, 0, 11, 17, 32], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 17, 60]] | 0 | 370 | 2 |
#include <stdio.h>
#include <stdlib.h>
#define WHITE 0
#define BRACK 1
int **matrix;
int *d;
int *parent;
int *color;
void prim(int);
int main() {
int n, i, j;
int cost = 0;
scanf("%d", &n);
color = malloc(n * sizeof(int));
d = malloc(n * sizeof(int));
parent = malloc(n * sizeof(int));
matrix = mall... | #include <stdio.h>
#include <stdlib.h>
#define WHITE 0
#define BRACK 1
int **matrix;
int *d;
int *parent;
int *color;
void prim(int);
int main() {
int n, i, j;
int cost = 0;
scanf("%d", &n);
color = malloc(n * sizeof(int));
d = malloc(n * sizeof(int));
parent = malloc(n * sizeof(int));
matrix = mall... | [["-", 0, 7, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 12, 13], ["-", 8, 9, 0, 1, 0, 11, 31, 69, 71, 13], ["+", 8, 9, 0, 1, 0, 11, 31, 69, 71, 13]] | 0 | 494 | 4 |
#include <stdio.h>
#define MAX 100
#define INFTY 21
#define WHITE 0
#define GRAY 1
#define BLACK 2
int n, M[MAX][MAX];
int prim(void);
int main() {
int i, j, e;
scanf("%d", &n);
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) {
scanf("%d", &e);
if (e == -1) {
M[i][j] = INFTY;
}... | #include <stdio.h>
#define MAX 100
#define INFTY 2000
#define WHITE 0
#define GRAY 1
#define BLACK 2
int n, M[MAX][MAX];
int prim(void);
int main() {
int i, j, e;
scanf("%d", &n);
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) {
scanf("%d", &e);
if (e == -1) {
M[i][j] = INFTY;
... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59]] | 0 | 413 | 2 |
#include <stdio.h>
#define N 100
#define INF 100
#define WHITE 1
#define BLACK 0
int main() {
int d[N], color[N], w[N][N];
int i, j, v;
int n, u;
int mincost;
int count = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) {
scanf("%d", &w[i][j]);
}
}
for (i = 0; ... | #include <stdio.h>
#define N 100
#define INF 100000
#define WHITE 1
#define BLACK 0
int main() {
int d[N], color[N], w[N][N];
int i, j, v;
int n, u;
int mincost;
int count = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) {
scanf("%d", &w[i][j]);
}
}
for (i = ... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59]] | 0 | 294 | 2 |
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
/*
* ????????????????????\??????????£??????\???????????????
* ????????§??????max??????????§?????????¨??????????£?????????????????????????????????£???????????????????????\??§??¨?????????????????????
*/
#define ELEMENT_NUM 100
typedef struc... | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
/*
* ????????????????????\??????????£??????\???????????????
* ????????§??????max??????????§?????????¨??????????£?????????????????????????????????£???????????????????????\??§??¨?????????????????????
*/
#define ELEMENT_NUM 1000000
typedef s... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59]] | 0 | 704 | 2 |
#include <stdio.h>
#define MAX 100
#define INF (1 << 2l)
#define WHITE 0
#define GRAY 1
#define BLACK 2
int n;
int M[MAX][MAX]; // M[u][v]にuからvへの辺の重みを記録した隣接行列
int prim();
int main() {
int i, j, e;
scanf("%d", &n);
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) {
scanf("%d", &e);
M[i][j] ... | #include <stdio.h>
#define MAX 100
#define INF (1 << 21)
#define WHITE 0
#define GRAY 1
#define BLACK 2
int n, M[MAX][MAX]; // M[u][v]にuからvへの辺の重みを記録した隣接行列
int prim();
int main() {
int i, j, e;
scanf("%d", &n);
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) {
scanf("%d", &e);
M[i][j] = (e... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["-", 36, 36, 36, 36, 0, 30, 0, 43, 0, 35], ["-", 36, 36, 36, 36, 0, 30, 0, 43, 39, 40], ["+", 36, 36, 36, 36, 0, 30, 0, 43, 0, 21]] | 0 | 407 | 5 |
#include <stdio.h>
#define MAX 102
#define WHITE 0
#define BLACK 1
#define GRAY 2
#define INF 10000000
#define NIL -1
int n;
int a[MAX][MAX], d[MAX], pi[MAX], color[MAX];
void prim() {
int i, u, v, mincost;
for (u = 0; u < n; u++) {
d[u] = INF;
pi[u] = NIL;
color[u] = WHITE;
}
d[0] = 0;
while... | #include <stdio.h>
#define MAX 102
#define WHITE 0
#define BLACK 1
#define GRAY 2
#define INF 10000000
#define NIL -1
int n;
int a[MAX][MAX], d[MAX], pi[MAX], color[MAX];
void prim() {
int i, u, v, mincost;
for (u = 0; u < n; u++) {
d[u] = INF;
pi[u] = NIL;
color[u] = WHITE;
}
d[0] = 0;
while... | [["+", 0, 14, 8, 9, 0, 1, 0, 2, 63, 22], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 25], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35]] | 0 | 385 | 4 |
#include <stdio.h>
#define INF 102
#define NIL -1
#define WHITE 1
#define BLACK 3
int n, a[101][101], d[101], color[101], pi[101], adj[101];
void prim(int r) {
int i;
for (i = 1; i <= n; i++) {
d[i] = INF;
pi[i] = NIL;
color[i] = WHITE;
}
d[r] = 0;
}
int main() {
int i, j, min, sum = 0, u, min2,... | #include <stdio.h>
#define INF 2000
#define NIL -1
#define WHITE 1
#define BLACK 3
int n, a[101][101], d[101], color[101], pi[101], adj[101];
void prim(int r) {
int i;
for (i = 1; i <= n; i++) {
d[i] = INF;
pi[i] = NIL;
color[i] = WHITE;
}
d[r] = 0;
}
int main() {
int i, j, min, sum = 0, u, min2... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59]] | 0 | 395 | 2 |
#include <stdio.h>
int main() {
int g[101][101], a[101], f[101], n, i, j, k = 1, m = 0, num, sum = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) {
scanf("%d", &g[i][j]);
}
}
a[0] = 0;
f[0] = 1;
for (i = 1; i < n; i++)
f[i] = 0;
while (1) {
num = 2000;
... | #include <stdio.h>
int main() {
int g[101][101], a[101], f[101], n, i, j, k = 1, m = 0, num, sum = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) {
scanf("%d", &g[i][j]);
}
}
a[0] = 0;
f[0] = 1;
for (i = 1; i < n; i++)
f[i] = 0;
while (1) {
num = 2000;
... | [["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 22], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 22]] | 0 | 276 | 2 |
#include <stdio.h>
#define MAX 100
#define NIL -1
#define WHITE 0
#define BLACK 1
int prim(int, int (*)[], int[], int[], int[]);
int main() {
int i, j, n, ans;
scanf("%d", &n);
int a[n][n], d[n], pi[n], color[n];
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++)
scanf("%d", &a[i][j]);
}
ans ... | #include <stdio.h>
#define MAX 200000
#define NIL -1
#define WHITE 0
#define BLACK 1
int prim(int, int (*)[], int[], int[], int[]);
int main() {
int i, j, n, ans;
scanf("%d", &n);
int a[n][n], d[n], pi[n], color[n];
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++)
scanf("%d", &a[i][j]);
}
a... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59]] | 0 | 420 | 2 |
#include <limits.h>
#include <stdio.h>
#define MAX 101
typedef struct {
int w;
int u;
int v;
} HEN;
HEN all[MAX] = {0};
int n;
int num = 0;
int DS[MAX] = {0};
int rank[MAX] = {0};
void inithen() {
int i;
for (i = 0; i < MAX; ++i) {
all[i].w = INT_MAX;
}
return;
}
void add(int weight, int a, int b) ... | #include <limits.h>
#include <stdio.h>
#define MAX 10000
typedef struct {
int w;
int u;
int v;
} HEN;
HEN all[MAX] = {0};
int n;
int num = 0;
int DS[MAX] = {0};
int rank[MAX] = {0};
void inithen() {
int i;
for (i = 0; i < MAX; ++i) {
all[i].w = INT_MAX;
}
return;
}
void add(int weight, int a, int b... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22]] | 0 | 608 | 4 |
#include <stdio.h>
#define N 100
#define INF 10000
#define NIL -1
#define WHITE 1
#define BLACK 0
int prim();
int n, d[N], pi[N], color[N], G[N][N];
int main() {
int i, j;
scanf("%d", &n);
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) {
scanf("%d", &G[i][j]);
}
}
printf("%d\n", prim()... | #include <stdio.h>
#define N 100
#define INF 10000
#define NIL -1
#define WHITE 1
#define BLACK 0
int prim();
int n, d[N], pi[N], color[N], G[N][N];
int main() {
int i, j;
scanf("%d", &n);
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) {
scanf("%d", &G[i][j]);
}
}
printf("%d\n", prim()... | [["+", 0, 30, 0, 14, 8, 9, 0, 37, 0, 38], ["+", 0, 30, 0, 14, 8, 9, 0, 37, 0, 22], ["+", 0, 30, 0, 14, 8, 9, 0, 37, 0, 35]] | 0 | 354 | 3 |
#include <stdio.h>
#define N 100
#define INF 10000
#define WHITE 0
#define BLACK 1
int G[N][N];
int n;
int prim() {
int i, u, v, d[N], pi[N], color[N];
int c, mincost;
for (i = 0; i < n; i++) {
d[i] = N;
pi[i] = -1;
color[i] = WHITE;
}
while (1) {
mincost = INF;
for (i = 0; i < n; i++) {
... | #include <stdio.h>
#define N 2000
#define INF 10000
#define WHITE 0
#define BLACK 1
int G[N][N];
int n;
int prim() {
int i, u, v, d[N], pi[N], color[N];
int c, mincost;
for (i = 0; i < n; i++) {
d[i] = N;
pi[i] = -1;
color[i] = WHITE;
}
while (1) {
mincost = INF;
for (i = 0; i < n; i++) {... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59]] | 0 | 366 | 2 |
#include <stdio.h>
#define WHITE 0
#define BLACK 1
#define GRAY 2
#define INF 10000000
int n;
void prim();
int main() {
int i, j, mincost = 0, k, u, color[100], M[100][100], d[100], p[100], ans = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) {
scanf(" %d", &M[i][j]);
}
}... | #include <stdio.h>
#define WHITE 0
#define BLACK 1
#define GRAY 2
#define INF 10000000
int n;
void prim();
int main() {
int i, j, mincost = 0, k, u, color[100], M[100][100], d[100], p[100], ans = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) {
scanf(" %d", &M[i][j]);
}
}... | [["+", 8, 9, 0, 1, 0, 11, 12, 16, 31, 22], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]] | 0 | 346 | 2 |
#include <stdio.h>
#define MAX 100
#define INF 100000000
#define W 0
#define G 1
#define B 2
int n, M[MAX][MAX];
int prim() {
int i, j, u, min, sum = 0;
int d[MAX], p[MAX], color[MAX];
for (i = 0; i < n; i++) {
d[i] = INF;
p[i] = -1;
color[i] = W;
}
d[0] = 0;
while (1) {
min = INF;
u ... | #include <stdio.h>
#define MAX 100
#define INF 100000000
#define W 0
#define G 1
#define B 2
int n, M[MAX][MAX];
int prim() {
int i, j, u, min, sum = 0;
int d[MAX], p[MAX], color[MAX];
for (i = 0; i < n; i++) {
d[i] = INF;
p[i] = -1;
color[i] = W;
}
d[0] = 0;
while (1) {
min = INF;
u ... | [["+", 0, 1, 0, 2, 3, 4, 0, 66, 17, 67]] | 0 | 394 | 1 |
#include <stdio.h>
#define N 100
int G[N][N];
int x[N], y[N];
int min(int);
int main() {
int a, i, j, n;
scanf("%d", &n);
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) {
scanf("%d", &G[i][j]);
}
}
a = min(n);
printf("%d\n", a);
return 0;
}
int min(int n) {
int i, j, k = 1;
int m... | #include <stdio.h>
#define N 100
int G[N][N];
int x[N], y[N];
int min(int);
int main() {
int a, i, j, n;
scanf("%d", &n);
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) {
scanf("%d", &G[i][j]);
}
}
a = min(n);
printf("%d\n", a);
return 0;
}
int min(int n) {
int i, j, k = 1;
int m... | [["-", 0, 52, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 12, 13]] | 0 | 310 | 2 |
#include <stdio.h>
int i, j, n, e, M[100][100];
int prim(int n) {
int u, sum, mincost, d[100], p[100], color[100];
for (i = 0; i < n; i++) {
d[i] = (1 << 21);
p[i] = -1;
color[i] = 0;
}
d[0] = 0;
while (1) {
mincost = (1 << 21);
u = -1;
for (i = 0; i < n; i++) {
if (mincost >... | #include <stdio.h>
int i, j, n, e, M[100][100];
int prim(int n) {
int u, sum, mincost, d[100], p[100], color[100];
for (i = 0; i < n; i++) {
d[i] = (1 << 21);
p[i] = -1;
color[i] = 0;
}
d[0] = 0;
while (1) {
mincost = (1 << 21);
u = -1;
for (i = 0; i < n; i++) {
if (mincost >... | [["-", 0, 2, 3, 4, 0, 2, 3, 4, 0, 22], ["+", 0, 2, 3, 4, 0, 2, 3, 4, 0, 22]] | 0 | 400 | 2 |
#include <stdio.h>
int main() {
int n, i, j, min, e, f;
int b[1000], c[1000], A[1000][1000];
int wa = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
b[i] = 0;
c[i] = 1000;
for (j = 0; j < n; j++) {
scanf("%d", &A[i][j]);
}
}
c[0] = 0;
for (i = 1; i < n; i++) {
min = 1000;
... | #include <stdio.h>
int main() {
int n, i, j, min, e, f;
int b[1000], c[1000], A[1000][1000];
int wa = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
b[i] = 0;
c[i] = 1000;
for (j = 0; j < n; j++) {
scanf("%d", &A[i][j]);
}
}
c[0] = 0;
for (i = 1; i < n; i++) {
min = 1000;
... | [["-", 15, 23, 0, 16, 12, 16, 31, 69, 71, 22], ["+", 15, 23, 0, 16, 12, 16, 31, 69, 71, 22]] | 0 | 289 | 2 |
#include <iostream>
using namespace std;
static const int MAX = 100;
static const int INFTY = (1 << 21);
static const int WHITE = 0;
static const int GRAY = 1;
static const int BLACK = 2;
struct Node {
int color, dist, parent;
};
int n, M[MAX][MAX];
Node node[MAX];
void Printnodes() {
string col[3] = {"WHITE", "... | #include <iostream>
using namespace std;
static const int MAX = 100;
static const int INFTY = (1 << 21);
static const int WHITE = 0;
static const int GRAY = 1;
static const int BLACK = 2;
struct Node {
int color, dist, parent;
};
int n, M[MAX][MAX];
Node node[MAX];
void Printnodes() {
string col[3] = {"WHITE", "... | [["-", 0, 57, 15, 339, 51, 16, 31, 16, 17, 47], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 17, 20], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 20], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 79], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13]] | 1 | 497 | 6 |
#include <iostream>
using namespace std;
int n;
int a[101][101];
int flg[101];
int t[101];
int sum = 0;
void visit() {
int ima = 0;
int mine = 100000000;
for (int k = 0; k < n; k++) {
for (int i = 0; i < n; i++) {
if (flg[i] == 0 && mine > t[i]) {
mine = t[i];
ima = i;
}
}
... | #include <iostream>
using namespace std;
int n;
int a[101][101];
int flg[101];
int t[101];
int sum = 0;
void visit() {
int ima = 0;
int mine = 100000000;
for (int k = 0; k < n - 1; k++) {
mine = 10000000;
for (int i = 0; i < n; i++) {
if (flg[i] == 0 && mine > t[i]) {
mine = t[i];
... | [["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 8, 9, 0, 7, 8, 9, 0, 1, 0, 35]] | 1 | 321 | 6 |
#include <bits/stdc++.h>
#define rep(i, a) for (i = 0; i < a; i++)
using namespace std;
static const int W = 0;
static const int G = 1;
static const int B = 2;
void prim(int n, int &total, vector<vector<int>> &M) {
int i, u, min;
vector<int> d(n);
vector<int> p(n);
vector<int> color(n);
rep(i, n) {
d[i]... | #include <bits/stdc++.h>
#define rep(i, a) for (i = 0; i < a; i++)
using namespace std;
static const int W = 0;
static const int G = 1;
static const int B = 2;
void prim(int n, int &total, vector<vector<int>> &M) {
int i, u, min;
vector<int> d(n);
vector<int> p(n);
vector<int> color(n);
rep(i, n) {
d[i]... | [["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 79], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 12, 22]] | 1 | 416 | 2 |
#include <algorithm>
#include <iostream>
#include <vector>
int color(std::vector<std::vector<int>> v) {
std::vector<int> color(v.size(), 0);
int count = 0, color_count = 1;
for (int i = 1; i <= 2000; i++) {
for (size_t j = 0; j < v.size(); j++) {
for (size_t k = j + 1; k < v.size(); k++) {
if (... | #include <algorithm>
#include <iostream>
#include <vector>
int color(std::vector<std::vector<int>> v) {
std::vector<int> color(v.size(), 0);
int count = 0, color_count = 1;
for (int i = 0; i <= 2000; i++) {
for (size_t j = 0; j < v.size(); j++) {
for (size_t k = j + 1; k < v.size(); k++) {
if (... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 366 | 2 |
#include <iostream>
using namespace std;
static const int MAX = 100;
static const int INF = (1 << 21);
static const int BLACK = 2;
static const int WHITE = 0;
static const int GLAY = 1;
int n, M[MAX][MAX];
int prim() {
int d[MAX], p[MAX], color[MAX];
for (int i = 0; i < n; i++) {
d[i] = INF;
p[i] = -1;
... | #include <iostream>
using namespace std;
static const int MAX = 100;
static const int INF = (1 << 21);
static const int BLACK = 2;
static const int WHITE = 0;
static const int GLAY = 1;
int n, M[MAX][MAX];
int prim() {
int d[MAX], p[MAX], color[MAX];
for (int i = 0; i < n; i++) {
d[i] = INF;
p[i] = -1;
... | [["-", 8, 9, 0, 57, 15, 339, 51, 11, 17, 32], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 79]] | 1 | 400 | 2 |
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int p[100001], s[100001], t[10001], cost[10001];
int root(int a) {
if (p[a] == a)
return a;
return (p[a] = ro... | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int p[100001], s[100001], t[100001], cost[100001];
int root(int a) {
if (p[a] == a)
return a;
return (p[a] = ... | [["-", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 47], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 20]] | 1 | 407 | 8 |
#include <algorithm>
#include <iostream>
#include <utility>
using namespace std;
int p[100];
pair<int, int> a[10000];
int root(int m) {
if (p[m] != m)
p[m] = root(p[m]);
return p[m];
}
void unit(int x, int y) { p[root(y)] = root(x); }
bool same(int x, int y) { return root(x) == root(y); }
int main() {
in... | #include <algorithm>
#include <iostream>
#include <utility>
using namespace std;
int p[100];
pair<int, int> a[10000];
int root(int m) {
if (p[m] != m)
p[m] = root(p[m]);
return p[m];
}
void unit(int x, int y) { p[root(y)] = root(x); }
bool same(int x, int y) { return root(x) == root(y); }
int main() {
in... | [["-", 15, 339, 51, 16, 12, 16, 31, 16, 31, 22], ["+", 15, 339, 51, 16, 12, 16, 31, 16, 31, 22], ["-", 15, 339, 51, 16, 12, 16, 12, 16, 31, 22], ["+", 15, 339, 51, 16, 12, 16, 12, 16, 31, 22]] | 1 | 315 | 4 |
#include <bits/stdc++.h>
using namespace std;
#define MAX 100
#define INF 1 << 25
int n, cost[MAX][MAX];
int mincost[MAX];
bool used[MAX];
int prim() {
for (int i = 0; i < n; i++)
mincost[i] = INF, used[i] = false;
mincost[0] = 0;
int res = 0;
while (1) {
int v = -1;
for (int u = 0; u < n; u++)
... | #include <bits/stdc++.h>
using namespace std;
#define MAX 100
#define INF 1 << 25
int n, cost[MAX][MAX];
int mincost[MAX];
bool used[MAX];
int prim() {
for (int i = 0; i < n; i++)
mincost[i] = INF, used[i] = false;
mincost[0] = 0;
int res = 0;
while (1) {
int v = -1;
for (int u = 0; u < n; u++)
... | [["+", 0, 30, 0, 14, 8, 9, 0, 37, 0, 38], ["+", 0, 30, 0, 14, 8, 9, 0, 37, 0, 22], ["+", 0, 30, 0, 14, 8, 9, 0, 37, 0, 35]] | 1 | 266 | 3 |
#include <iostream>
using namespace std;
#define INF 1000000
int main() {
int n;
int G[100][100], d[100];
int minc, mi, i;
bool flg[i];
int sum = 0;
cin >> n;
for (i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
cin >> G[i][j];
if (G[i][j] == -1)
G[i][j] = INF;
}
d[i] ... | #include <iostream>
using namespace std;
#define INF 10000000
int main() {
long n;
long G[100][100], d[100];
long minc, mi, i;
bool flg[100];
long sum = 0;
cin >> n;
for (i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
cin >> G[i][j];
if (G[i][j] == -1)
G[i][j] = INF;
}
... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["-", 0, 14, 8, 9, 0, 43, 49, 80, 81, 22], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13]] | 1 | 303 | 12 |
#include <algorithm>
#include <cstring>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
typedef long long ll;
#define MAX_V 100
#define INF int(1e9)
// g : ??°??????, V : g???????????°, s : ????????????????????????
int Prim(int g[MAX_V + 1][MAX_V + 1], int V, int s) {
ll ret = 0, min_, nx... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
typedef long long ll;
#define MAX_V 100
#define INF int(1e9)
// g : ??°??????, V : g???????????°, s : ????????????????????????
int Prim(int g[MAX_V + 1][MAX_V + 1], int V, int s) {
ll ret = 0, min_, nx... | [["+", 0, 57, 15, 339, 51, 16, 31, 69, 28, 22], ["+", 15, 339, 51, 16, 31, 69, 341, 342, 0, 70], ["+", 15, 339, 51, 16, 31, 69, 341, 342, 0, 73]] | 1 | 350 | 3 |
#include <cstdio>
#include <vector>
int main(void) {
int n, min_edge, next_node, count, sum;
scanf("%d", &n);
std::vector<std::vector<int>> edges;
std::vector<int> isUsed;
edges.resize(n);
isUsed.resize(n);
for (int i = 0; i < n; i++) {
isUsed[i] = -1;
edges[i].resize(n);
for (int j = 0; j < ... | #include <cstdio>
#include <vector>
int main(void) {
int n, min_edge, next_node, count, sum;
scanf("%d", &n);
std::vector<std::vector<int>> edges;
std::vector<int> isUsed;
edges.resize(n);
isUsed.resize(n);
for (int i = 0; i < n; i++) {
isUsed[i] = -1;
edges[i].resize(n);
for (int j = 0; j < ... | [["-", 8, 9, 0, 52, 15, 339, 51, 16, 12, 13], ["+", 0, 52, 15, 339, 51, 16, 12, 16, 31, 22], ["+", 0, 52, 15, 339, 51, 16, 12, 16, 17, 33], ["+", 0, 52, 15, 339, 51, 16, 12, 16, 12, 13]] | 1 | 279 | 4 |
#include <climits>
#include <iostream>
#include <queue>
using namespace std;
static const int MAX = 100;
static const int WHITE = 1;
static const int GRAY = 2;
static const int BLACK = 3;
int n, M[MAX + 10][MAX + 10];
int prim() {
int u, minv;
int d[MAX], p[MAX], color[MAX];
for (int i = 0; i < n; i++) {
... | #include <climits>
#include <iostream>
#include <queue>
using namespace std;
static const int MAX = 100;
static const int WHITE = 1;
static const int GRAY = 2;
static const int BLACK = 3;
int n, M[MAX + 10][MAX + 10];
int prim() {
int u, minv;
int d[MAX], p[MAX], color[MAX];
for (int i = 0; i < n; i++) {
... | [["-", 0, 7, 8, 9, 0, 1, 0, 11, 12, 22], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 12, 22]] | 1 | 401 | 2 |
#include <stdio.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
int main(void) {
int n, i, j, ans = 0;
scanf("%d", &n);
int a[n][n];
char f[n];
rep(i, n) rep(j, n) scanf("%d", &a[i][j]);
rep(i, n) f[i] = 0;
f[0] = 1;
rep(i, n - 1) {
int min = 10000, minx, miny;
rep(j, n) {
rep(k, n) {
... | #include <stdio.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
int main(void) {
int n, i, j, ans = 0;
scanf("%d", &n);
int a[n][n];
char f[n];
rep(i, n) rep(j, n) scanf("%d", &a[i][j]);
rep(i, n) f[i] = 0;
f[0] = 1;
rep(i, n - 1) {
int min = 10000, minx, miny;
rep(j, n) {
rep(k, n) {
... | [["-", 15, 339, 51, 16, 31, 16, 12, 16, 17, 47], ["+", 15, 339, 51, 16, 31, 16, 12, 16, 17, 20]] | 1 | 214 | 2 |
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
template <typename FirstType, typename SecondType> struct PairComparator {
bool operator()(const pair<FirstType, SecondType> &p1,
const pair<FirstType, SecondType> &p2) const {
return p1.first > p2.first;
}
};
bool inM... | #include <iostream>
#include <queue>
#include <vector>
using namespace std;
template <typename FirstType, typename SecondType> struct PairComparator {
bool operator()(const pair<FirstType, SecondType> &p1,
const pair<FirstType, SecondType> &p2) const {
return p1.first > p2.first;
}
};
bool inM... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 47], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 20]] | 1 | 452 | 2 |
size = STDIN.gets.to_i
matrix = (0...size).inject([]) do |result|
result << STDIN.gets.split[0...size].map { |v| v == "-1" ? nil : v.to_i}
end
# プリムのアルゴリズム
MAX_WEIGHT = 101
visited = Array.new(size, false)
parent = Array.new(size)
min_edges = Array.new(size, MAX_WEIGHT)
loop do
min_edge = MAX_WEIGHT + 1
vertex... | size = STDIN.gets.to_i
matrix = (0...size).inject([]) do |result|
result << STDIN.gets.split[0...size].map { |v| v == "-1" ? nil : v.to_i}
end
# プリムのアルゴリズム
MAX_WEIGHT = 2001
visited = Array.new(size, false)
parent = Array.new(size)
min_edges = Array.new(size, MAX_WEIGHT)
loop do
min_edge = MAX_WEIGHT + 1
verte... | [["-", 36, 36, 36, 36, 0, 493, 0, 662, 12, 612], ["+", 36, 36, 36, 36, 0, 493, 0, 662, 12, 612]] | 4 | 243 | 2 |
# encoding: utf-8
class UFSet
def initialize(sz)
@sz = sz
@par = [0] * sz
(0..sz - 1).each { |idx| @par[idx] = idx}
end
def find(x)
if @par[x] == x
x
else
@par[x] = find(@par[x])
end
end
def same(x, y)
find(x) == find(y)
end
def unite(x, y)
fx = find(x)
... | # encoding: utf-8
class UFSet
def initialize(sz)
@sz = sz
@par = [0] * sz
(0..sz - 1).each { |idx| @par[idx] = idx}
end
def find(x)
if @par[x] == x
x
else
@par[x] = find(@par[x])
end
end
def same(x, y)
find(x) == find(y)
end
def unite(x, y)
fx = find(x)
... | [["-", 0, 493, 0, 269, 8, 736, 0, 735, 141, 22], ["+", 0, 493, 0, 269, 8, 736, 0, 735, 141, 22], ["-", 196, 737, 8, 736, 0, 751, 15, 738, 17, 47], ["+", 196, 737, 8, 736, 0, 751, 15, 738, 17, 20], ["-", 8, 736, 0, 652, 3, 4, 0, 652, 735, 22], ["+", 8, 736, 0, 652, 3, 4, 0, 652, 735, 22]] | 4 | 318 | 6 |
class Forest:
def __init__(self, g, id):
self.forest = set([id])
self.graph = g
self.next_wait = self.graph[id]
self.wait = 0
def add_tree(self, id):
self.wait += self.next_wait[id]
self.forest.update([id])
self.marge_next_wait(id)
def next_tr... | class Forest:
def __init__(self, g, id):
self.forest = set([id])
self.graph = g
self.next_wait = self.graph[id]
self.wait = 0
def add_tree(self, id):
self.wait += self.next_wait[id]
self.forest.update([id])
self.marge_next_wait(id)
def next_t... | [["-", 0, 656, 0, 7, 12, 652, 3, 4, 0, 612], ["+", 0, 7, 12, 652, 3, 4, 0, 657, 31, 22], ["+", 0, 7, 12, 652, 3, 4, 0, 657, 17, 33], ["+", 0, 7, 12, 652, 3, 4, 0, 657, 12, 612]] | 5 | 259 | 4 |
INFTY = 10000000000000000000000000000
n = int(input())
A = {}
for i in range(n):
A[i] = {}
for j,c in enumerate(input().strip().split(' ')):
c = int(c)
if c > 0: A[i][j] = c
d = {}
chosen = {}
for i in range(n):
d[i] = INFTY
chosen[i] = False
d[0] = 0
ans = 0
while True:
mincost = ... | INFTY = 10000000000000000000000000000
n = int(input())
A = {}
for i in range(n):
A[i] = {}
for j,c in enumerate(input().strip().split(' ')):
c = int(c)
if c > -1: A[i][j] = c
d = {}
chosen = {}
for i in range(n):
d[i] = INFTY
chosen[i] = False
d[0] = 0
ans = 0
while True:
mincost =... | [["-", 0, 7, 8, 196, 0, 57, 15, 666, 0, 612], ["+", 8, 196, 0, 57, 15, 666, 0, 664, 17, 33], ["+", 8, 196, 0, 57, 15, 666, 0, 664, 28, 612]] | 5 | 219 | 3 |
from heapq import heappush, heappop
def prim(G):
n = len(G)
heap = []
s = 0
for v, c in list(G[s].items()):
heappush(heap, (c, v))
added = set()
added.add(s)
cost = 0
while len(added) < n:
cu, u = heappop(heap)
added.add(u)
cost += cu
for v, c in ... | from heapq import heappush, heappop
def prim(G):
n = len(G)
heap = []
s = 0
for v, c in list(G[s].items()):
heappush(heap, (c, v))
added = set()
added.add(s)
cost = 0
while len(added) < n:
cu, u = heappop(heap)
if u in added:
continue
added.ad... | [["+", 8, 196, 0, 52, 8, 196, 0, 57, 0, 121], ["+", 0, 52, 8, 196, 0, 57, 15, 666, 0, 22], ["+", 0, 52, 8, 196, 0, 57, 15, 666, 667, 267], ["+", 8, 196, 0, 52, 8, 196, 0, 57, 0, 102], ["+", 8, 196, 0, 57, 64, 196, 0, 116, 0, 117]] | 5 | 248 | 6 |
def prim(n):
d = [None] * 100
p = [None] * 100
color = [None] * 100
for i in range(n):
d[i] = float('inf')
p[i] = -1
color[i] = 0
d[0] = 0
while(true):
minv = float('inf')
u = -1
for i in range(n):
if minv > d[i] and colo... | def prim(n):
d = [None] * 100
p = [None] * 100
color = [None] * 100
for i in range(n):
d[i] = float('inf')
p[i] = -1
color[i] = 0
d[0] = 0
while(True):
minv = float('inf')
u = -1
for i in range(n):
if minv > d[i] and colo... | [["-", 0, 14, 8, 196, 0, 52, 15, 23, 0, 22], ["+", 0, 14, 8, 196, 0, 52, 15, 23, 0, 146]] | 5 | 335 | 2 |
n = int(input())
A = []
p = list(range(1, n))
a = [[0 for i in range(n)]for j in range(n)]
for i in range(n):
a[i] = list(map(int, input().split() ))
l = 0
while p != []:
a_min = 10000
for i in A:
for j in p:
if 0 <= a[i][j] < a_min:
a_min = a[i][j]
add... | n = int(input())
A = [0]
p = list(range(1, n))
a = [[0 for i in range(n)]for j in range(n)]
for i in range(n):
a[i] = list(map(int, input().split() ))
l = 0
while p != []:
a_min = 10000
for i in A:
for j in p:
if 0 <= a[i][j] < a_min:
a_min = a[i][j]
ad... | [["+", 0, 656, 0, 1, 0, 662, 12, 634, 0, 612]] | 5 | 138 | 1 |
class Node(object):
def __init__(self, V):
self.V = V
self.d = float('inf')
self.p = -1
self.state = -1
# -1 -> undiscovered
# 1 -> finished
# 0 -> found(not finished)
M = [float('inf')] * 5
for i in range(5):
M[i] = [float('inf')] * 5
n = int(input()... | class Node(object):
def __init__(self, V):
self.V = V
self.d = float('inf')
self.p = -1
self.state = -1
# -1 -> undiscovered
# 1 -> finished
# 0 -> found(not finished)
M = [float('inf')] * 100
for i in range(100):
M[i] = [float('inf')] * 100
n = int(i... | [["-", 0, 656, 0, 1, 0, 662, 12, 657, 12, 612], ["+", 0, 656, 0, 1, 0, 662, 12, 657, 12, 612], ["-", 0, 656, 0, 7, 12, 652, 3, 4, 0, 612], ["+", 0, 656, 0, 7, 12, 652, 3, 4, 0, 612], ["-", 8, 196, 0, 1, 0, 662, 12, 657, 12, 612], ["+", 8, 196, 0, 1, 0, 662, 12, 657, 12, 612]] | 5 | 355 | 6 |
#include <limits.h>
#include <stdio.h>
#define N 100
#define WHITE 0
#define GRAY 1
#define BLACK 2
#define NIL -1
#define INF INT_MAX - 1
int G[N][N];
int d[N], pi[N], color[N];
int n;
void dijkstra(void) {
int i, u, v, mincost;
for (u = 0; u < n; u++) {
d[u] = INF;
pi[u] = NIL;
color[u] = WHITE;
}
... | #include <limits.h>
#include <stdio.h>
#define N 100
#define WHITE 0
#define GRAY 1
#define BLACK 2
#define NIL -1
#define INF INT_MAX - 1
int G[N][N];
int d[N], pi[N], color[N];
int n;
void dijkstra(void) {
int i, u, v, mincost;
for (u = 0; u < n; u++) {
d[u] = INF;
pi[u] = NIL;
color[u] = WHITE;
}
... | [["-", 0, 7, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 12, 22]] | 0 | 435 | 2 |
#include <stdio.h>
#define MAX 100
#define INFTY 100000
#define WHITE 0
#define GRAY 1
#define BLACK 2
int n, M[MAX][MAX];
void sssp() {
int i, u, v, minicost;
int d[MAX], color[MAX];
for (i = 0; i < n; i++) {
d[i] = INFTY;
color[i] = WHITE;
}
d[0] = 0;
color[0] = GRAY;
while (1) {
minicost ... | #include <stdio.h>
#define MAX 100
#define INFTY 900000000
#define WHITE 0
#define GRAY 1
#define BLACK 2
int n, M[MAX][MAX];
void sssp() {
int i, u, v, minicost;
int d[MAX], color[MAX];
for (i = 0; i < n; i++) {
d[i] = INFTY;
color[i] = WHITE;
}
d[0] = 0;
color[0] = GRAY;
while (1) {
minico... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["-", 64, 9, 0, 1, 0, 11, 12, 11, 17, 32], ["+", 64, 9, 0, 1, 0, 11, 12, 16, 17, 72]] | 0 | 451 | 4 |
#include <stdio.h>
#define MAX 10
static const int INFINITY = 1 << 21;
static const int WHITE = 0;
static const int GRAY = 1;
static const int BLACK = 2;
static int n;
static int M[MAX][MAX];
static void dijkstra() {
int minv;
int d[MAX];
int color[MAX];
for (int i = 0; i < n; i++) {
d[i] = INFINITY;
... | #include <stdio.h>
#define MAX 100
static const int INFINITY = 1 << 21;
static const int WHITE = 0;
static const int GRAY = 1;
static const int BLACK = 2;
static int n;
static int M[MAX][MAX];
static void dijkstra() {
int d[MAX];
int color[MAX];
for (int i = 0; i < n; i++) {
d[i] = INFINITY;
color[i] ... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["+", 8, 9, 0, 52, 8, 9, 0, 43, 39, 40]] | 0 | 459 | 6 |
#include <stdio.h>
#define INF 100000000
int n;
int size[100];
int to[100][100];
int cost[100][100];
int dist[100];
void dfs(int p, int c) {
int i;
dist[p] = c;
for (i = 0; i < size[i]; i++) {
if (dist[to[p][i]] > c + cost[p][i])
dfs(to[p][i], c + cost[p][i]);
}
}
main() {
int i, j;
scanf("%d",... | #include <stdio.h>
#define INF 100000000
int n;
int size[100];
int to[100][100];
int cost[100][100];
int dist[100];
void dfs(int p, int c) {
int i;
dist[p] = c;
for (i = 0; i < size[p]; i++) {
if (dist[to[p][i]] > c + cost[p][i])
dfs(to[p][i], c + cost[p][i]);
}
}
main() {
int i, j;
scanf("%d",... | [["-", 8, 9, 0, 7, 15, 16, 12, 69, 71, 22], ["+", 8, 9, 0, 7, 15, 16, 12, 69, 71, 22]] | 0 | 293 | 2 |
n = int(input())
a = []
for i in range(n):
inp = input()
if "-1" in inp:
inp = inp.replace("-1","10000")
a.append(list(map(int, inp.split())))
w = 0
v = set()
v.add(0)
while len(v) < n:
print(v)
min_w = 10000
min_idx = 0
i = 0
for node in v:
if min_w > min(a[node]):
... | n = int(input())
a = []
for i in range(n):
inp = input()
if "-1" in inp:
inp = inp.replace("-1","10000")
a.append(list(map(int, inp.split())))
w = 0
v = set()
v.add(0)
while len(v) < n:
min_w = 10000
min_idx = 0
i = 0
for node in v:
if min_w > min(a[node]):
m... | [["-", 0, 52, 8, 196, 0, 1, 0, 652, 63, 22], ["-", 8, 196, 0, 1, 0, 652, 3, 4, 0, 24], ["-", 8, 196, 0, 1, 0, 652, 3, 4, 0, 22], ["-", 8, 196, 0, 1, 0, 652, 3, 4, 0, 25]] | 5 | 168 | 4 |
n=int(input())
edgeList=[]
for i in range(n):
a=list(map(int,input().split()))
for j in range(i):
if a[j]>0:edgeList+=[[a[j],i,j]]
rootList=[-1]*n
sumLength=0
def getRoot(x):
r=rootList[x]
if r<0:rootList[x]=x
elif r!=x:rootList[x]=getRoot(r)
return rootList[x]
edgeList.sort(key=lambda x:x[0])
for e in edgeList... | n=int(input())
edgeList=[]
for i in range(n):
a=list(map(int,input().split()))
for j in range(i):
if a[j]>=0:edgeList+=[(a[j],i,j)]
rootList=[-1]*n
sumLength=0
def getRoot(x):
r=rootList[x]
if r<0:rootList[x]=x
elif r!=x:rootList[x]=getRoot(r)
return rootList[x]
edgeList.sort(key=lambda x:x[0])
for e in edgeLis... | [["-", 0, 7, 8, 196, 0, 57, 15, 666, 667, 47], ["+", 0, 7, 8, 196, 0, 57, 15, 666, 667, 20], ["-", 64, 196, 0, 1, 0, 677, 12, 634, 0, 70], ["+", 0, 1, 0, 677, 12, 634, 0, 660, 0, 24], ["-", 0, 1, 0, 677, 12, 634, 0, 634, 0, 73], ["+", 0, 1, 0, 677, 12, 634, 0, 660, 0, 25]] | 5 | 188 | 6 |
n = int(input())
sides = []
ws = []
ss = []
for _ in range(n):
sides.append(list(map(int,input().split())))
for i in range(n):
for j in range(i+1,n):
if sides[i][j] > 0:
ws.append([sides[i][j],i,j])
rs = [(i) for i in range(n)]
def root(x):
global rs
if rs[x] == x:
return(x)
... | n = int(input())
sides = []
ws = []
ss = []
for _ in range(n):
sides.append(list(map(int,input().split())))
for i in range(n):
for j in range(i+1,n):
if sides[i][j] >= 0:
ws.append([sides[i][j],i,j])
rs = [(i) for i in range(n)]
def root(x):
global rs
if rs[x] == x:
return(x)... | [["-", 0, 7, 8, 196, 0, 57, 15, 666, 667, 47], ["+", 0, 7, 8, 196, 0, 57, 15, 666, 667, 20], ["+", 64, 196, 0, 1, 0, 662, 12, 652, 63, 22], ["+", 0, 1, 0, 662, 12, 652, 3, 4, 0, 24], ["+", 0, 1, 0, 662, 12, 652, 3, 4, 0, 25]] | 5 | 235 | 5 |
import sys
INF = float('inf')
n = int(input())
adja_matrix = [[int(i) for i in line.split()] for line in sys.stdin.read().splitlines()]
condition = ['INIT'] * n
distance = [INF] * n
p = [0] * n
distance[0] = 0
p[0] = -1
while True:
mincost = INF
for i in range(n):
if condition[i] != 'FINISH' and distan... | import sys
INF = float('inf')
n = int(input())
adja_matrix = [[int(i) for i in line.split()] for line in sys.stdin.read().splitlines()]
condition = ['INIT'] * n
distance = [INF] * n
p = [0] * n
distance[0] = 0
p[0] = -1
while True:
mincost = INF
for i in range(n):
if condition[i] != 'FINISH' and distan... | [["-", 0, 57, 15, 679, 31, 666, 0, 206, 206, 22], ["+", 0, 57, 15, 679, 31, 666, 0, 206, 206, 22]] | 5 | 245 | 2 |
n = int(input())
m = []
for _ in range(n):
tmp = [int(x) for x in input().split()]
m.append(tmp)
edge_list = []
j = 1
for i in range(n-1):
for k,x in enumerate(m[i][j:]):
if x != -1:
edge_list.append((x,i,k))
else:
pass
j += 1
edge_list.sort()
root_list = [i ... | n = int(input())
m = []
for _ in range(n):
tmp = [int(x) for x in input().split()]
m.append(tmp)
#辺を全て持つリストを作る
edge_list = []
j = 1
for i in range(n-1):
for k,x in enumerate(m[i][j:]):
if x != -1:
edge_list.append((x,i,k+j))
else:
pass
j += 1
edge_list.sort()
... | [["+", 0, 652, 3, 4, 0, 660, 0, 657, 17, 72], ["+", 0, 652, 3, 4, 0, 660, 0, 657, 12, 22], ["-", 8, 196, 0, 57, 64, 196, 0, 674, 0, 675], ["+", 8, 196, 0, 57, 64, 196, 0, 116, 0, 117]] | 5 | 239 | 4 |
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintStream;
import java.util.Arrays;
import java.util.NoSuchElementException;
public class Main {
private static final PrintStream ps = System.out;
private static final InputStream IS = System.in;
private static final byte[] BUFFER = new by... |
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintStream;
import java.util.Arrays;
import java.util.NoSuchElementException;
public class Main {
private static final PrintStream ps = System.out;
private static final InputStream IS = System.in;
private static final byte[] BUFFER = new by... | [["+", 0, 492, 3, 4, 0, 16, 31, 16, 31, 22], ["+", 0, 492, 3, 4, 0, 16, 31, 16, 17, 72], ["+", 3, 4, 0, 16, 31, 16, 12, 5, 0, 62], ["+", 3, 4, 0, 16, 31, 16, 12, 5, 0, 491], ["+", 0, 1, 0, 492, 3, 4, 0, 16, 17, 72]] | 3 | 1,188 | 6 |
import java.io.*;
import java.util.*;
public class Main {
static int M[][];
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
M = new int[n][n];
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++)
M[i][j] = -1;
}
for ... | import java.io.*;
import java.util.*;
public class Main {
static int M[][];
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
M = new int[n][n];
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++)
M[i][j] = -1;
}
for ... | [["+", 0, 57, 15, 15, 0, 16, 12, 16, 17, 72], ["+", 15, 15, 0, 16, 12, 16, 12, 504, 516, 22], ["+", 15, 15, 0, 16, 12, 16, 12, 504, 0, 70], ["+", 15, 15, 0, 16, 12, 16, 12, 504, 71, 22], ["+", 15, 15, 0, 16, 12, 16, 12, 504, 0, 73]] | 3 | 514 | 5 |
#include <stdio.h>
static const int MAX = 500;
static const int INFTY = (1 << 21);
int main(void) {
int n, i, j;
int M[MAX][MAX];
int d[MAX];
int key[MAX];
int p[MAX];
int m, u, k, c, v;
/* your code*/
scanf("%d", &n);
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) {
M[i][j] = INFTY;
... | #include <stdio.h>
static const int MAX = 500;
static const int INFTY = (1 << 21);
int main(void) {
int n, i, j;
int M[MAX][MAX];
int d[MAX];
int key[MAX];
int p[MAX];
int m, u, k, c, v;
/* your code*/
scanf("%d", &n);
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) {
M[i][j] = INFTY;
... | [["-", 0, 1, 0, 11, 12, 16, 31, 69, 71, 22], ["+", 0, 1, 0, 11, 12, 16, 31, 69, 71, 22], ["-", 0, 1, 0, 11, 12, 16, 12, 69, 71, 22], ["+", 0, 1, 0, 11, 12, 16, 12, 69, 71, 22]] | 0 | 417 | 4 |
#include <stdio.h>
void koria(int, int);
void koria(int i, int c) { printf("%d \n", c); }
static const int MAX = 500;
static const int INY = (1 << 21);
int main() {
int n;
int i;
int j;
int u;
int v;
int c;
int k;
int min = INY;
int M[MAX][MAX];
int cost[MAX];
int vis[MAX];
int p[MAX];
sc... | #include <stdio.h>
void koria(int, int);
void koria(int i, int c) { printf("%d %d\n", i, c); }
static const int MAX = 500;
static const int INY = (1 << 21);
int main() {
int n;
int i;
int j;
int u;
int v;
int c;
int k;
int min = INY;
int M[MAX][MAX];
int cost[MAX];
int vis[MAX];
int p[MAX];
... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 21], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 22]] | 0 | 444 | 4 |
#include <stdio.h>
#define MAX 100
#define INFTY 21
#define WHITE 0
#define GRAY 1
#define BLACK 2
int n, M[MAX][MAX];
void dijkstra(void);
int main() {
int i, j, u, k, v, c;
scanf("%d", &n);
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) {
M[i][j] = INFTY;
}
}
for (i = 0; i < n; i++) {
... | #include <stdio.h>
#define MAX 100
#define INFTY 200000
#define WHITE 0
#define GRAY 1
#define BLACK 2
int n, M[MAX][MAX];
void dijkstra(void);
int main() {
int i, j, u, k, v, c;
scanf("%d", &n);
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) {
M[i][j] = INFTY;
}
}
for (i = 0; i < n; i++)... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59]] | 0 | 457 | 2 |
#include <stdio.h>
#define INF 10000000
#define NIL -1
#define BLACK 1
#define WHITE 0
void dijkstra(void);
int n, a[101][101], w = 0, d[101], pi[101], color[101];
int main() {
int i, j, u, k, v;
scanf("%d", &n);
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) {
a[i][j] = -1;
}
}
for (i... | #include <stdio.h>
#define INF 10000000
#define NIL -1
#define BLACK 1
#define WHITE 0
void dijkstra(void);
int n, a[101][101], w = 0, d[101], pi[101], color[101];
int main() {
int i, j, u, k, v;
scanf("%d", &n);
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) {
a[i][j] = -1;
}
}
for (i... | [["+", 15, 23, 0, 16, 12, 16, 31, 16, 17, 72], ["+", 0, 16, 12, 16, 31, 16, 12, 69, 28, 22], ["+", 0, 16, 12, 16, 31, 16, 12, 69, 0, 70], ["+", 0, 16, 12, 16, 31, 16, 12, 69, 71, 22], ["+", 0, 16, 12, 16, 31, 16, 12, 69, 0, 73]] | 0 | 441 | 5 |
#include <stdio.h>
#define inf 2000000
#define NIL -1000000
#define BLACK 9999999
#define WHITE 8888888
typedef struct {
int u;
int k;
int v[100000];
int c[100000];
} graph;
void dijkstra(int n, graph w[n], int d[n], int color[n], int pi[n]) {
int i, j, u;
int mincost;
for (i = 0; i < n; i++) {
d[i... | #include <stdio.h>
#define inf 2000000
#define NIL -1000000
#define BLACK 9999999
#define WHITE 8888888
typedef struct {
int u;
int k;
int v[3000];
int c[3000];
} graph;
void dijkstra(int n, graph w[n], int d[n], int color[n], int pi[n]) {
int i, j, u;
int mincost;
for (i = 0; i < n; i++) {
d[i] = ... | [["-", 39, 122, 8, 123, 0, 124, 49, 80, 81, 13], ["+", 39, 122, 8, 123, 0, 124, 49, 80, 81, 13], ["-", 8, 9, 0, 7, 8, 7, 15, 16, 12, 13], ["+", 8, 9, 0, 7, 8, 7, 15, 16, 12, 13]] | 0 | 530 | 6 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.