제출 #670853

#제출 시각아이디문제언어결과실행 시간메모리
670853Essa2006Ronald (COCI17_ronald)C++14
120 / 120
30 ms444 KiB
#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<bitset<1001>>E(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]; for(int i=1;i<=n;i++){ for(int j=1;j<i;j++){ if((P[i]+P[j])%2==E[i][j]%2) return cout<<"NE", 0; } } cout<<"DA"; }
#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...