QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#571129 | #9310. Permutation Counting 4 | zhangxiaopen | WA | 142ms | 3644kb | C++17 | 1.1kb | 2024-09-17 20:40:07 | 2024-09-17 20:40:07 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for(int i=a;i<=n;i++)
#define per(i,n,a) for(int i=n;i>=a;i--)
#define PII pair<int,int>
#define lowbit(x) x&(-x)
#define int long long
#define endl "\n"
using namespace std;
const int inf=1e10;
const int MOD=998244353;
const int N=2e3+5;
void solve()
{
int n;
cin>>n;
vector<int> mp[n+2];
for(int i=1;i<=n;i++)
{
int l,r;
cin>>l>>r;
mp[l].push_back(r+1);//要判断是否是一棵树,如果是就是1,否则是0
mp[r+1].push_back(l);
}
vector<int> vis(n+1,0);
int ans=1;
vis[1]=1;
function<void(int)> dfs=[&](int u)->void
{
for(auto v:mp[u])
{
if(!vis[v])
{
vis[v]=1;
dfs(v);
ans++;
}
}
};
dfs(1);
// cout<<ans<<endl;
if(ans==n)
{
cout<<1<<endl;
}
else cout<<0<<endl;
}
signed main()
{
//注意爆long long还是限制long long
//看下单测多测?多测注意清空全局数组
ios::sync_with_stdio(false);//快读注释这一段
cin.tie(0);
cout.tie(0);
int _=1;
cin>>_;
for(int i=1;i<=_;i++)
{
solve();
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3564kb
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: 142ms
memory: 3644kb
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:
1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 1 0 0 0 0 1 0 0 0 0 0 1 0 1 0 1 0 0 1 1 0 1 0 0 1 1 0 0 0 0 0 0 0 0 1 1 0 0 1 1 0 0 0 0 0 0 0 1 1 1 0 0 0 1 0 1 0 0 0 0 1 0 0 0 0 0 0 0 0 1 0 0 1 1 0 0 1 0 1 1 1 1 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 1 0 1 1 ...
result:
wrong answer 2nd words differ - expected: '1', found: '0'