답안 #101890

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
101890 2019-03-20T20:07:49 Z Benq Mostovi (COI14_mostovi) C++14
100 / 100
396 ms 17912 KB
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")

#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/rope>

using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= (a); i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)
#define trav(a, x) for (auto& a : x)

#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound

#define sz(x) (int)x.size()
#define beg(x) x.begin()
#define en(x) x.end()
#define all(x) beg(x), en(x)
#define resz resize

const int MOD = 1000000007; // 998244353
const ll INF = 1e18;
const int MX = 100001;
const ld PI = 4*atan((ld)1);

template<class T> void ckmin(T &a, T b) { a = min(a, b); }
template<class T> void ckmax(T &a, T b) { a = max(a, b); }

template<class A, class B> A operator+=(A& l, const B& r) { return l = l+r; }
template<class A, class B> A operator-=(A& l, const B& r) { return l = l-r; }
template<class A, class B> A operator*=(A& l, const B& r) { return l = l*r; }
template<class A, class B> A operator/=(A& l, const B& r) { return l = l/r; }

namespace input {
    template<class T> void re(complex<T>& x);
    template<class T1, class T2> void re(pair<T1,T2>& p);
    template<class T> void re(vector<T>& a);
    template<class T, size_t SZ> void re(array<T,SZ>& a);

    template<class T> void re(T& x) { cin >> x; }
    void re(double& x) { string t; re(t); x = stod(t); }
    void re(ld& x) { string t; re(t); x = stold(t); }
    template<class Arg, class... Args> void re(Arg& first, Args&... rest) { 
        re(first); re(rest...); 
    }

    template<class T> void re(complex<T>& x) { T a,b; re(a,b); x = cd(a,b); }
    template<class T1, class T2> void re(pair<T1,T2>& p) { re(p.f,p.s); }
    template<class T> void re(vector<T>& a) { F0R(i,sz(a)) re(a[i]); }
    template<class T, size_t SZ> void re(array<T,SZ>& a) { F0R(i,SZ) re(a[i]); }
}

using namespace input;

namespace output {
    template<class T1, class T2> void pr(const pair<T1,T2>& x);
    template<class T, size_t SZ> void pr(const array<T,SZ>& x);
    template<class T> void pr(const vector<T>& x);
    template<class T> void pr(const set<T>& x);
    template<class T1, class T2> void pr(const map<T1,T2>& x);

    template<class T> void pr(const T& x) { cout << x; }
    template<class Arg, class... Args> void pr(const Arg& first, const Args&... rest) { 
        pr(first); pr(rest...); 
    }

    template<class T1, class T2> void pr(const pair<T1,T2>& x) { 
        pr("{",x.f,", ",x.s,"}"); 
    }
    template<class T> void prContain(const T& x) {
        pr("{");
        bool fst = 1; trav(a,x) pr(!fst?", ":"",a), fst = 0; 
        pr("}");
    }
    template<class T, size_t SZ> void pr(const array<T,SZ>& x) { prContain(x); }
    template<class T> void pr(const vector<T>& x) { prContain(x); }
    template<class T> void pr(const set<T>& x) { prContain(x); }
    template<class T1, class T2> void pr(const map<T1,T2>& x) { prContain(x); }
    
    void ps() { pr("\n"); } 
    template<class Arg, class... Args> void ps(const Arg& first, const Args&... rest) { 
        pr(first," "); ps(rest...); // print w/ spaces
    }
}

using namespace output;

namespace io {
    void setIn(string s) { freopen(s.c_str(),"r",stdin); }
    void setOut(string s) { freopen(s.c_str(),"w",stdout); }
    void setIO(string s = "") {
        ios_base::sync_with_stdio(0); cin.tie(0); // fast I/O
        if (sz(s)) { setIn(s+".in"), setOut(s+".out"); } // for USACO
    }
}

using namespace io;

template<class T> T invGeneral(T a, T b) {
    a %= b; if (a == 0) return b == 1 ? 0 : -1;
    T x = invGeneral(b,a); 
    return x == -1 ? -1 : ((1-(ll)b*x)/a+b)%b;
}

template<class T> struct modInt {
    T val;
    T mod = 0;
    // static const T mod = MOD;

    void normalize() {
        if (mod == 0) return;
        val %= mod; if (val < 0) val += mod;
    }
    modInt(T v = 0, T m = 0) : val(v), mod(m) { normalize(); }
    // modInt(T v = 0, T m = 0) : val(v) { normalize(); }

    explicit operator T() const { return val; }
    friend ostream& operator<<(ostream& os, const modInt& a) { return os << a.val; }
    friend bool operator==(const modInt& a, const modInt& b) { return a.val == b.val; }
    friend bool operator!=(const modInt& a, const modInt& b) { return !(a == b); }

    friend void check(modInt& a, modInt& b) { // make sure all operations are valid
        // comment out if mod is static const
        if (a.mod > 0 && b.mod > 0) { assert(a.mod == b.mod); return; }
        T mod = max(a.mod,b.mod); if (mod == 0) mod = MOD;
        if (a.mod != mod) { a.mod = mod; a.normalize(); }
        if (b.mod != mod) { b.mod = mod; b.normalize(); }
    }
    friend modInt operator+(modInt a, modInt b) {
        check(a,b); a.val += (T)b;
        if (a.val >= a.mod) a.val -= a.mod;
        return a;
    }
    friend modInt operator-(modInt a, modInt b) {
        check(a,b); a.val -= (T)b; 
        if (a.val < 0) a.val += a.mod; 
        return a;
    }
    friend modInt operator-(const modInt& a) { return modInt(0)-a; }

    friend modInt operator*(modInt a, modInt b) {
        check(a,b); a.val = (ll)a.val*(T)b%a.mod; return a;
    }
    friend modInt exp(modInt a, ll p) {
        modInt ans(1,a.mod);
        for (; p; p /= 2, a *= a) if (p&1) ans *= a;
        return ans;
    }
    friend modInt inv(const modInt& a) {
        return {invGeneral(a.val,a.mod),a.mod};
        // return exp(b,b.mod-2) if prime
    }
    friend modInt operator/(modInt a, modInt b) { 
        check(a,b); return a*inv(b); 
    }
};

typedef modInt<int> mi;
typedef pair<mi,mi> pmi;
typedef vector<mi> vmi;
typedef vector<pmi> vpmi;

int N,M;

int co;
pi en[200001];

set<int> bad;
map<int,pi> m;

int ge(set<int>& a, int b) {
	auto it = a.lb(b);
	if (it == a.end()) return MOD;
	return *it;
}

int le(set<int>& a, int b) {
	auto it = a.ub(b);
	if (it == a.begin()) return -MOD;
	return *prev(it);
}

void ad(int g1, int g2) {
    if (g1 > g2) swap(g1,g2);
    assert(g1 <= N && g2 > N);
    auto it = m.lb(g1);
    if (it != m.begin()) ckmin(prev(it)->s.f,g1-1);
    it = m.ub(g2);
    if (it != m.end()) ckmax(it->s.f,g2+1);
    
    en[++co] = {g1,g2};
    
    pi res = {N,co};
    ckmin(res.f,ge(bad,g1));
    it = m.lb(g1); if (it != m.end()) ckmin(res.f,it->f-1);
    m[g1] = res;
    
    res = {N+1,co};
    ckmax(res.f,le(bad,g2-1)+1);
    it = m.ub(g2); if (it != m.begin()) ckmax(res.f,prev(it)->f+1);
    m[g2] = res;
}

void rem(int g1, int g2) {
    if (g1 > g2) swap(g1,g2);
    assert(g1+1 == g2);
    bad.insert(g1);
    if (g1 <= N) {
    	auto it = m.ub(g1); if (it == m.begin()) return;
    	it = prev(it); ckmin(it->s.f,g1);
    } else {
    	auto it = m.lb(g2); if (it == m.end()) return;
    	ckmax(it->s.f,g2);
    }
}

bool direct(int g1, int g2) {
	if (g1 <= N) {
		if (g2 < g1 || g2 > N) return 0;
		return ge(bad,g1) >= g2;
	} else {
		if (g2 <= N || g2 > g1) return 0;
		return le(bad,g1-1) < g2;
	}
}

bool reach(int a, int b) {
	if (a == -1 || b == -1) return 0;
	int r = min(ge(bad,en[a].f),N);
	int l = max(le(bad,en[a].s-1),N)+1;
	return en[b].f <= r && en[b].s >= l;
}

int getz(int x) {
	if (x <= N) {
		auto it = m.ub(x); if (it == m.begin()) return -1;
		it = prev(it); if (it->s.f < x) return -1;
		return it->s.s;
	} else {
		auto it = m.lb(x); if (it == m.end()) return -1;
		if (it->s.f > x) return -1;
		return it->s.s;
	}
}

bool posi(int g1, int g2) {
    if (direct(g1,g2)) return 1;
    int z = -1;
    if (g1 > N) {
    	auto it = m.ub(g1); if (it == m.begin()) return 0;
    	it = prev(it);
    	if (!direct(g1,it->f)) return 0;
    	z = it->s.s;
    } else {
    	auto it = m.lb(g1); if (it == m.end()) return 0;
    	if (!direct(g1,it->f)) return 0;
    	z = it->s.s;
    }
    return reach(z,getz(g2));
}

int main() {
    setIO(); re(N,M);
    F0R(i,M) {
        char t; int g1,g2; re(t,g1,g2);
        if (t == 'A') {
            ad(g1,g2);
        } else if (t == 'B') {
            rem(g1,g2);
        } else {
            if (posi(g1,g2)) ps("DA");
            else ps("NE");
        }
    }
}

/* stuff you should look for
    * int overflow, array bounds
    * special cases (n=1?), set tle
    * do smth instead of nothing and stay organized
*/

Compilation message

mostovi.cpp: In function 'void io::setIn(std::__cxx11::string)':
mostovi.cpp:117:35: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
     void setIn(string s) { freopen(s.c_str(),"r",stdin); }
                            ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
mostovi.cpp: In function 'void io::setOut(std::__cxx11::string)':
mostovi.cpp:118:36: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
     void setOut(string s) { freopen(s.c_str(),"w",stdout); }
                             ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 3 ms 512 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 312 ms 14328 KB Output is correct
8 Correct 315 ms 14172 KB Output is correct
9 Correct 303 ms 13584 KB Output is correct
10 Correct 396 ms 17912 KB Output is correct