제출 #370247

#제출 시각아이디문제언어결과실행 시간메모리
370247Atill83Ronald (COCI17_ronald)C++14
120 / 120
43 ms6400 KiB
#include <bits/stdc++.h> #define ff first #define ss second #define endl '\n' using namespace std; const long long INF = (long long) 1e18; const int mod = (int) 1e9+7; const int MAXN = (int) 1e3+5; typedef long long ll; typedef unsigned long long ull; typedef pair<int,int> pii; typedef pair<ll,ll> pll; ll n; int og[MAXN][MAXN]; int dur[MAXN]; bool do_it(vector<int> v){ for(int i = 1; i < n; i++) v[i] = !(og[i][0] ^ v[0]); for(int i = 1; i < n; i++) for(int j = i + 1; j < n; j++){ if((og[i][j] ^ (v[i] ^ v[j])) == 0) return 0; } return 1; } int main(){ ios_base::sync_with_stdio(false); cin.tie(nullptr);cout.tie(nullptr); #ifdef Local freopen("C:/Users/Admin/Desktop/Yazilim/C/IO/int.txt","r",stdin); freopen("C:/Users/Admin/Desktop/Yazilim/C/IO/out.txt","w",stdout); #endif int m; cin>>n>>m; for(int i = 0; i < m; i++){ int a, b; cin>>a>>b; a--; b--; og[a][b] = og[b][a] = 1; } vector<int> durum1(n, 0), durum2(n, 0); durum2[0] = 1; if(do_it(durum1) || do_it(durum2)) cout<<"DA"<<endl; else cout<<"NE"<<endl; #ifdef Local cout<<endl<<fixed<<setprecision(2)<<1000.0 * clock() / CLOCKS_PER_SEC<< " milliseconds "; #endif }
#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...