oj.uz

답안 #254526

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
254526 2020-07-30T07:47:12 Z leaked Zamjena (COCI18_zamjena) C++14
70 / 70
 937 ms 19012 KB 
#include<bits/stdc++.h>
using namespace std;
//#include<ext/pb_ds/assoc_container.hpp>
//#include<ext/pb_ds/tree_policy.hpp>
//
//    #pragma GCC optimize("unroll-loops")
//    #pragma GCC optimize("Ofast")
//    #pragma GCC optimize("-O3")
//    #pragma GCC optimize("no-stack-protector")
//    #pragma GCC optimize("fast-math")
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx")
//#define LOCAL
#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
  enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c* x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifndef LOCAL
~debug() { cerr << endl; }
eni(!=) cerr << boolalpha << i; ris; }
eni(==) ris << range(begin(i), end(i)); }
sim, class b dor(pair < b, c > d) {
  ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
  *this << "[";
  for (auto it = d.b; it != d.e; ++it)
	*this << ", " + 2 * (it == d.b) << *it;
  ris << "]";
}
#else
sim dor(const c&) { ris; }
#endif
};
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
#define fi first
#define f first
#define se second
#define s second
#define vi_a vector<int>a;
#define p_b push_back
////////////////////////////////???????????????CHECK THIS OUT???????????????//////////////////////////////
#define ll long long
typedef unsigned long long ull;
////////////////////////////////???????????????CHECK THIS OUT???????????????//////////////////////////////
#define ld long double
#define pll pair<ll,ll>
#define pii pair<int,int>
#define m_p make_pair
#define fast_io cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(0);
#define all(x) x.begin(),x.end()
#define getfiles    ifstream cin("input.txt");ofstream cout("output.txt");
#define pw(x) (1ll << x)
#define sz(x) (int)x.size()
#define endl "\n"
#define rall(x) x.rbegin(),x.rend()
#define len(a) (ll)a.size()
#define rep(x,l,r) for(ll x=l;x<r;x++)

//using namespace __gnu_pbds;
ld eps = (ld)1 / 1e6;
const ld pi=3.14159265359;
ll inf = 1e18,mod1=1e9+7;
ll sqr(ll a) { return a * a; }
ll qb(ll a) { return a * a * a; }
ll gcd(ll a, ll b) { return !a ? b : gcd(b % a, a); }
ll binpow(ll a, ll b, ll mod) { return b ? (b % 2 ? (a * (sqr(binpow(a, b / 2, mod)) % mod)) % mod : sqr(binpow(a, b / 2, mod)) % mod) : 1; }
ll binmult(ll a, ll b, ll mod) { return b ? (b % 2 ? (2 * binmult(a, b / 2, mod) + a) % mod : (2 * binmult(a, b / 2, mod)) % mod) : 0; }
/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
const ll R=1e4;
const ll tx[4]={0,0,-1,1};
const ll ty[4]={-1,1,0,0};
const char rev_to[4]={'E','W','N','S'};
const int M=999999937;
const int N=400000+2;
const int ppp=73;
const int Y=1;
const int X=0;
//typedef tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update> st;
auto rnd=bind(uniform_int_distribution<ll>(1,125),mt19937(time(0)));
void bad(){
    cout<<"NE";
    exit(0);
}
map<string,int>mp;
map<string,vector<string>>g;
int toint(string s){
    int v=0;
    for(auto &z : s) v*=10,v+=z-'0';
    return v;
}
map<string,bool>used;
void dfs(string v,int curval){
    used[v]=1;
    if(!curval){
        if(mp.find(v)!=mp.end()) curval=mp[v];
    }else{
        if(mp.find(v)!=mp.end()) {
                if(curval!=mp[v]){
                        bad();
                }
        }
        else mp[v]=curval;
    }
//    debug()<<imie(v)<<imie(mp[v]);
    for(auto &z : g[v]){
        if(!used[z]) dfs(z,curval);
//              debug()<<imie(v)<<imie(z)<<imie(mp[v])<<imie(mp[z]);
        if(curval && mp[v]!=mp[z]) bad();
//        debug()<<imie(v)<<imie(z)<<imie(mp[v])<<imie(mp[z]);
    }
}
void go(string v){
    queue<string>q;
    q.push(v);
    used[v]=1;
    while(!q.empty()){
        auto v=q.front();q.pop();
//        debug()<<imie(v)<<imie(mp[v]);
        for(auto &z : g[v]){
            if(!used[z]){
                used[z]=1;
                q.push(z);
            }
            if(mp[v]){
                    if(mp[z]){
                        if(mp[v]!=mp[z]) bad();
                    }
                    else mp[z]=mp[v];
                }else{
                     if(mp[z]){
                        mp[v]=mp[z];
                    }
                }
        }
    }
}
signed main()
{
    fast_io;
    int n;
    cin>>n;
    vector<string>a(n),b(n);
    for(auto &z : a)cin>>z;
    for(auto &z : b)cin>>z;
    for(int i=0;i<n;i++){
        int f=0,s=0;
        if(a[i][0]>='0' && a[i][0]<='9'){
            f=toint(a[i]);
        }
        if(b[i][0]>='0' && b[i][0]<='9'){
           s=toint(b[i]);
        }
        if(f && s){
            if(f!=s) bad();
            else continue;
        }
        if(f){
            if(mp.find(b[i])!=mp.end()) {
                    if(mp[b[i]]!=f)bad();
//                    mp[b[i]]=f;
            }
             mp[b[i]]=f;
        }
        if(s){
             if(mp.find(a[i])!=mp.end()) {
                    if(mp[a[i]]!=s)bad();

            }
            mp[a[i]]=s;
        }
        if(!f && !s)g[a[i]].p_b(b[i]);
        if(!f && !s)g[b[i]].p_b(a[i]);
    }
    for(auto &z : a) if(mp[z]) go(z);
    for(auto &z : b) if(mp[z]) go(z);
    cout<<"DA";
    return 0;
}
/*
5
z 3 x y 3
2 y 3 z 3

/
*/

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 640 KB Output is correct
2 Correct 7 ms 640 KB Output is correct
3 Correct 8 ms 1152 KB Output is correct
4 Correct 5 ms 1152 KB Output is correct
5 Correct 24 ms 1280 KB Output is correct
6 Correct 7 ms 1024 KB Output is correct

Subtask #5
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 2944 KB Output is correct
2 Correct 227 ms 6520 KB Output is correct
3 Correct 91 ms 9080 KB Output is correct
4 Correct 79 ms 9336 KB Output is correct
5 Correct 882 ms 19012 KB Output is correct
6 Correct 937 ms 13060 KB Output is correct