oj.uz

Submission #228269

# Submission time Handle Problem Language Result Execution time Memory
228269 2020-04-30T10:36:46 Z Blerargh Ronald (COCI17_ronald) C++17
120 / 120
 47 ms 10104 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> ii;
typedef pair<ld,ld> id;
typedef tuple<ll,ll,ll> tl;
typedef tuple<ll,ll,ll,ll> ql;

#define FOR(i, a, b) for(ll i=(a); i<=(b); i++)
#define ROF(i, a, b) for(ll i=(a); i>=(b); i--)
#define MEM(x, v) memset(x, v, sizeof(x))
#define FILL(x, n, v) fill(x, x+n, v);
#define ALL(x) x.begin(), x.end()
#define FAST ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);

#define f first
#define s second
#define ins insert
#define e emplace
#define eb emplace_back
#define ef emplace_front
#define p push
#define pf push_front
#define pb push_back
#define mp make_pair
#define ub upper_bound
#define lb lower_bound
#define ft front
#define bk back
#define pp pop
#define ppb pop_back
#define ppf pop_front

#define db cout<<"YEET\n";
#define ct(x) cout<<x<<'\n';

const ll MOD = 1e9+7; //998244353
const ll MAXN = 1000+5;
const ll INF = 1e18;
const ld PI = acos((ld)-1);

ll adjmat[MAXN][MAXN];

int main(){
    FAST
    ll n, m;
    cin >> n >> m;
    vector<ll> v;
    FOR(i,1,m){
        ll a, b;
        cin >> a >> b;
        adjmat[a][b] = 1;
        adjmat[b][a] = 1;
        if (a==1 || b==1) v.pb(max(a,b));
    }
    ll sz = v.size();
    FOR(i,0,sz-1){
        ll u = v[i];
        FOR(j,1,n){
            if (j==u) continue;
            else adjmat[u][j]^=1, adjmat[j][u]^=1;
        }
    }
    FOR(i,2,n) adjmat[1][i] = adjmat[i][1] = 1;

    bool yes=1;
    FOR(i,1,n){
        FOR(j,1,n){
            if (i==j) continue;
            if (!adjmat[i][j]) yes=0;
            if (!yes) break;
        }
        if (!yes) break;
    }
    if (yes) cout << "DA";
    else cout << "NE";
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 512 KB Output is correct

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 640 KB Output is correct
4 Correct 5 ms 512 KB Output is correct

Subtask #6
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 640 KB Output is correct
2 Correct 5 ms 768 KB Output is correct
3 Correct 5 ms 768 KB Output is correct
4 Correct 5 ms 768 KB Output is correct

Subtask #7
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1536 KB Output is correct
2 Correct 16 ms 4864 KB Output is correct
3 Correct 9 ms 2432 KB Output is correct
4 Correct 7 ms 2432 KB Output is correct

Subtask #8
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1536 KB Output is correct
2 Correct 12 ms 4608 KB Output is correct
3 Correct 34 ms 9464 KB Output is correct
4 Correct 47 ms 10104 KB Output is correct