제출 #137113

#제출 시각아이디문제언어결과실행 시간메모리
137113KLPPRonald (COCI17_ronald)C++14
120 / 120
194 ms6392 KiB
#include<bits/stdc++.h> using namespace std; typedef long long int lld; #define rep(i,a,b) for(int i=a;i<b;i++) int main(){ int n,m; cin>>n>>m; int table[n][n]; rep(i,0,n){ rep(j,0,n)table[i][j]=0; } rep(i,0,m){ int x,y; cin>>x>>y; x--;y--; table[x][y]=1; table[y][x]=1; } int arr[n]; arr[0]=0; rep(i,1,n){ arr[i]=1-table[0][i]; } rep(i,0,n){ rep(j,i+1,n){ if((arr[i]+arr[j]+table[i][j])%2==0){ cout<<"NE"<<endl; return 0; } } } cout<<"DA"<<endl; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...