QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#322333#6765. Don't Really Like How The Story Endsmshcherba#WA 54ms3688kbC++201.1kb2024-02-06 21:08:552024-02-06 21:08:55

Judging History

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

  • [2024-02-06 21:08:55]
  • 评测
  • 测评结果:WA
  • 用时:54ms
  • 内存:3688kb
  • [2024-02-06 21:08:55]
  • 提交

answer

#include <bits/stdc++.h>

using namespace std;

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--)
#define SZ(a) int(a.size())
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first
#define S second

typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef double db;

const int N = 1 << 17;

int n, m;
VI g[N];
int ans;
int ptr;

void dfs(int v, int p)
{
	assert(v == ptr - 1);
	for (int to : g[v])
	{
		while (ptr < to)
		{
			ptr++;
			ans++;
			dfs(ptr - 1, v);
		}
		if (ptr == to)
		{
			ptr++;
			dfs(to, v);
		}
	}
	while (v == 0 && ptr < n)
	{
		ptr++;
		ans++;
		dfs(ptr - 1, v);
	}
}

void solve()
{
	cin >> n >> m;
	FOR(i, 0, m)
	{
		int u, v;
		cin >> u >> v;
		u--;
		v--;
		g[u].PB(v);
		g[v].PB(u);
	}
	ans = 0;
	ptr = 1;
	dfs(0, -1);
	cout << ans << "\n";
	FOR(i, 0, n)
		g[i].clear();
}

int main()
{
	ios::sync_with_stdio(0); 
	cin.tie(0);
	int t;
	cin >> t;
	while (t--)
		solve();
	return 0;
}

詳細信息

Test #1:

score: 100
Accepted
time: 1ms
memory: 3688kb

input:

3
2 3
1 1
1 2
2 1
4 1
1 4
4 2
1 2
3 4

output:

0
2
1

result:

ok 3 lines

Test #2:

score: -100
Wrong Answer
time: 54ms
memory: 3680kb

input:

117747
3 7
2 1
3 3
1 3
1 1
3 2
1 1
3 1
4 8
2 3
4 3
3 2
4 2
1 3
2 1
4 3
2 4
3 4
2 3
2 2
3 3
1 1
2 5
1 1
2 2
2 2
1 2
2 2
3 7
2 1
1 2
3 3
3 2
1 2
3 3
3 2
4 5
1 2
3 3
4 4
1 4
2 1
3 1
3 2
1 3
1 1
1 1
1 1
1 6
1 1
1 1
1 1
1 1
1 1
1 1
5 4
2 1
2 5
1 3
3 2
4 7
1 1
2 4
3 2
1 1
1 1
4 2
2 3
5 8
3 3
2 2
4 2
1 4
1...

output:

0
1
1
0
0
1
1
0
0
2
2
2
0
0
2
0
2
0
1
0
1
3
0
0
0
3
1
1
1
0
0
0
3
1
2
1
3
0
3
2
3
1
2
2
0
0
1
2
0
2
0
1
3
0
0
2
0
0
1
1
0
3
0
1
0
1
1
0
0
3
2
0
0
0
1
0
3
3
0
2
1
1
1
1
0
3
1
3
0
1
2
0
1
0
3
0
0
3
1
0
2
1
0
0
1
0
1
0
0
0
0
4
0
0
0
0
1
0
3
0
1
0
0
1
1
0
0
2
0
2
0
2
0
2
2
1
2
1
0
1
0
1
0
1
1
2
1
1
0
1
...

result:

wrong answer 2nd lines differ - expected: '0', found: '1'