QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#566827 | #9310. Permutation Counting 4 | zeemanz# | TL | 3ms | 4600kb | C++20 | 1.0kb | 2024-09-16 02:08:25 | 2024-09-16 02:08:25 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
constexpr int N = 1E6;
void solve() {
int n;
cin >> n;
vector<int> l(n), r(n);
for (int i = 0; i < n; i++) {
cin >> l[i] >> r[i];
l[i]--;
}
vector<bitset<N>> a(n);
for (int i = 0; i < n; i++) {
bitset<N> x;
for (int j = l[i]; j < r[i]; j++) {
x[j] = 1;
}
for (int j = 0; j < n; j++) {
if (x[j]) {
if (a[j].count() == 0) {
a[j] = x;
break;
}
x ^= a[j];
}
}
}
for (int i = 0; i < n; i++) {
if (a[i].count() == 0) {
cout << "0\n";
return;
}
}
cout << "1\n";
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout << fixed << setprecision(16);
int t = 1;
cin >> t;
while (t--) {
solve();
}
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 3ms
memory: 4600kb
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
Time Limit Exceeded
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...