This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
const int mxn = 2e5+10;
vector<int> pos[mxn];
int arr[mxn][2];
int N,M;
bitset<mxn> vis;
int main(){
ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin>>N>>M;
for(int i = 1;i<=M;i++){
for(int j = 0;j<2;j++){
cin>>arr[i][j];
pos[arr[i][j]].push_back((i<<1)|j);
}
}
int ans = 0;
for(int i = 1;i<=N;i++){
int p1 = pos[i][0],p2 = pos[i][1];
if((p1^p2) == 1)ans += 0;
else{
if(!(p1&1)&&arr[p1>>1][1])ans++;
if(!(p2&1)&&arr[p2>>1][1])ans++;
if(!(p1&1)&&!(p2&1))ans++;
}
}
cout<<ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |