QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#574425#9310. Permutation Counting 4XyeeChengWA 122ms3792kbC++23963b2024-09-18 22:03:502024-09-18 22:03:51

Judging History

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

  • [2024-09-18 22:03:51]
  • 评测
  • 测评结果:WA
  • 用时:122ms
  • 内存:3792kb
  • [2024-09-18 22:03:50]
  • 提交

answer

#include <bits/stdc++.h>

using namespace std;

#define endl '\n'
#define int long long
#define IOS ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define rep(i, a, n) for (int i = a; i <= n; i++)
#define per(i, a, n) for (int i = n; i >= a; i--)
#define all(x) (x).begin(), (x).end()
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;

void solve()
{
	int n;
	cin >> n;
	vector<vector<int>> a(n + 2);
	rep (i, 1, n)
	{
		int l, r;
		cin >> l >> r;
		a[l].push_back(r);
	}
	rep (i, 1, n)
	{
		if (a[i].empty())
		{
			cout << 0 << endl;
			return;
		}
		int last = i;
		sort(all(a[i]));
		for (auto x: a[i])
		{
			if (x == i)
			{
				continue;
			}
			if (last > x)
			{
				cout << 0 << endl;
				return;
			}
			a[last].push_back(x);
			last = x + 1;
		}
	}
	cout << 1 << endl;
}

signed main()
{
	IOS;
	int t = 1;
	cin >> t;
	while (t--) solve();
	return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 3792kb

input:

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

output:

0
1
0
0

result:

ok 4 tokens

Test #2:

score: -100
Wrong Answer
time: 122ms
memory: 3616kb

input:

66725
14
7 7
4 6
7 8
8 13
2 13
6 13
6 10
14 14
1 10
9 11
7 9
3 8
4 12
5 12
12
2 6
3 6
7 11
2 5
1 1
6 12
8 12
2 3
7 9
7 8
1 10
1 4
10
4 8
4 4
6 10
9 10
2 3
2 7
1 3
3 4
2 2
3 10
20
3 12
10 14
19 20
19 20
1 9
7 9
13 16
17 17
16 18
2 11
5 19
6 17
11 17
3 6
3 11
7 20
8 17
3 18
10 15
9 20
16
5 10
2 10
2 1...

output:

0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
1
0
0
1
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
...

result:

wrong answer 1st words differ - expected: '1', found: '0'