QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #722423 | #6765. Don't Really Like How The Story Ends | Sound_Medium | WA | 91ms | 3612kb | C++23 | 674b | 2024-11-07 18:59:01 | 2024-11-07 18:59:02 |
Judging History
answer
#include <bits/stdc++.h>
#define int long long
using namespace std;
int n, m;
const int N=1e5+10;
void solve () {
cin>>n>>m;
vector<vector<int>>g(n+1);
for(int i=1;i<=m;i++){
int u,v;
cin>>u>>v;
g[u].push_back(v);
g[v].push_back(u);
}
for(int i=1;i<=n;i++){
sort(g[i].begin(),g[i].end());
}
int cnt=0;
for(int i=2;i<=n;i++){
if(g[i].size()&&g[i][0]<=i-1){
}else cnt++;
}
cout<<cnt<<endl;
}
signed main () {
int T = 1;
std::ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
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: 3612kb
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: 91ms
memory: 3564kb
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 0 1 0 0 1 1 0 0 1 1 1 0 0 2 0 2 0 1 0 0 3 0 0 0 2 1 1 1 0 0 0 1 0 2 1 3 0 1 0 3 1 2 1 0 0 1 2 0 1 0 1 0 0 0 2 0 0 0 1 0 1 0 1 0 0 1 0 0 3 2 0 0 0 1 0 2 3 0 0 1 1 1 0 0 0 1 3 0 1 2 0 0 0 2 0 0 3 1 0 2 0 0 0 1 0 0 0 0 0 0 4 0 0 0 0 0 0 2 0 1 0 0 1 0 0 0 2 0 1 0 0 0 1 0 1 2 0 0 0 0 1 0 0 1 1 1 0 0 0 ...
result:
wrong answer 33rd lines differ - expected: '2', found: '1'