이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
#define FF first
#define SS second
#define all(a) a.begin(), a.end()
#define mod (ll)(1000000007)
int main(){
ios_base::sync_with_stdio(false);
int n, m;
cin>>n>>m;
vector<vector<int>>E(n+1, vector<int>(n+1));
while(m--){
int u, v;
cin>>u>>v;
E[u][v]=E[v][u]=1;
}
vector<int>P(n+1);
P[1]=1;
for(int i=2;i<=n;i++)
P[i]=E[1][i];
string ans="DA";
for(int i=1;i<=n;i++){
for(int j=1;j<i;j++){
if((P[i]+P[j])%2==E[i][j]%2){
ans="NE";
j=n+1, i=n+1;
break;
}
}
}
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... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |