QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#101832	#3846. Link-Cut Tree	Register_int	RE	0ms	3592kb	C++14	1.4kb	2023-05-01 12:41:17	2023-05-01 12:41:21

Judging History

你现在查看的是最新测评结果

[2023-08-10 23:21:45]
System Update: QOJ starts to keep a history of the judgings of all the submissions.

[2023-05-01 12:41:21]
评测

测评结果：RE
用时：0ms
内存：3592kb

查看

[2023-05-01 12:41:17]
提交

answer

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int MAXN = 1e5 + 10;
const int mod = 998244353;

struct edge {
	int v, nxt;
} e[MAXN << 1];

int head[MAXN], tot = 1;

inline 
void add(int u, int v) {
	e[++tot] = { v, head[u] }, head[u] = tot;
}

inline 
void clear(int n) {
	for (int i = 1; i <= n; i++) head[i] = 0; tot = 1;
}

int fa[MAXN];

int find(int k) {
	return k == fa[k] ? k : fa[k] = find(fa[k]);
}

inline 
bool merge(int u, int v) {
	return (u = find(u)) != (v = find(v)) && (fa[u] = v);
}

int pre[MAXN], id[MAXN];

int ans[MAXN], cnt, rt;

void init(int u) {
	if (!id[u]) rt = u;
	for (int i = head[u], v; i; i = e[i].nxt) {
		if ((i >> 1) == id[u]) continue; v = e[i].v;
		pre[v] = u, id[v] = i >> 1, init(v);
	}
}

inline 
void solve(int u) {
	for (cnt = 0; u != rt; u = pre[u]) ans[++cnt] = id[u];
}

int t, n, m, u[MAXN], v[MAXN];

int main() {
	for (scanf("%d", &t); t--; clear(n)) {
		scanf("%d%d", &n, &m), rt = 0;
		for (int i = 1; i <= m; i++) scanf("%d%d", &u[i], &v[i]);
		for (int i = 1; i <= n; i++) fa[i] = i;
		for (int i = 1; i <= m; i++) {
			if (!merge(u[i], v[i])) { init(u[i]), solve(v[i]), ans[++cnt] = i; break; }
			add(u[i], v[i]), add(v[i], u[i]);
		}
		if (!rt) { puts("-1"); continue; } sort(ans + 1, ans + cnt + 1);
		for (int i = 1; i <= cnt; i++) printf("%d%c", ans[i], " \n"[i == cnt]);
	}
}

源文件, 语言: C++14

详细

Test #1:

score: 100

Accepted

time: 0ms

memory: 3592kb

input:

output:

2 4 5 6
-1

result:

ok 2 lines

Test #2:

score: -100

Runtime Error

input: