oj.uz

답안 #100854

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
100854 2019-03-14T21:39:48 Z Benq 결혼 문제 (IZhO14_marriage) C++14
100 / 100
 473 ms 3676 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;

ll ans;
int N,M,K,match[30001], label[30001], tmp;
vi radj[30001];
deque<int> adj[2001];
queue<int> todo;

bool tri(int x) {
    if (!x) return 1;
    if (label[x] == tmp) return 0;
    label[x] = tmp;
    trav(i,adj[x]) if (match[i] != x && tri(match[i])) 
        return match[i] = x;
    return 0;
}

void process() {
    while (sz(todo)) {
        tmp ++;
        if (tri(todo.front())) todo.pop();
        else break;
    }
}

int main() {
    // you should actually read the stuff at the bottom
    setIO(); re(N,M,K);
    F0R(i,K) {
        int A,B; re(A,B);
        radj[A].pb(B);
    }
    FOR(i,1,M+1) todo.push(i);
    int r = 0;
    FOR(l,1,N+1) {
        process();
        while (r < N && sz(todo)) {
            r ++; trav(i,radj[r]) adj[i].pb(r);
            process();
        }
        if (sz(todo)) break;
        ans += N+1-r;
        if (match[l]) todo.push(match[l]);
        trav(i,radj[l]) adj[i].pop_front();
    }
    pr(ans);
    // you should actually read the stuff at the bottom
}

/* 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

marriage.cpp: In function 'bool tri(int)':
marriage.cpp:202:25: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
         return match[i] = x;
                ~~~~~~~~~^~~
marriage.cpp: In function 'void io::setIn(std::__cxx11::string)':
marriage.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); }
                            ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
marriage.cpp: In function 'void io::setOut(std::__cxx11::string)':
marriage.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); }
                             ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 2432 KB Output is correct
2 Correct 4 ms 2432 KB Output is correct
3 Correct 4 ms 2432 KB Output is correct
4 Correct 4 ms 2432 KB Output is correct
5 Correct 4 ms 2432 KB Output is correct
6 Correct 5 ms 2432 KB Output is correct
7 Correct 4 ms 2404 KB Output is correct
8 Correct 4 ms 2440 KB Output is correct
9 Correct 4 ms 2432 KB Output is correct
10 Correct 4 ms 2432 KB Output is correct
11 Correct 3 ms 2432 KB Output is correct
12 Correct 4 ms 2432 KB Output is correct
13 Correct 4 ms 2432 KB Output is correct
14 Correct 5 ms 2432 KB Output is correct
15 Correct 4 ms 2432 KB Output is correct
16 Correct 5 ms 2432 KB Output is correct
17 Correct 5 ms 2432 KB Output is correct
18 Correct 4 ms 2432 KB Output is correct
19 Correct 5 ms 2432 KB Output is correct
20 Correct 4 ms 2432 KB Output is correct
21 Correct 4 ms 2432 KB Output is correct
22 Correct 5 ms 2432 KB Output is correct
23 Correct 4 ms 2432 KB Output is correct
24 Correct 5 ms 2432 KB Output is correct
25 Correct 11 ms 2560 KB Output is correct
26 Correct 5 ms 2432 KB Output is correct
27 Correct 4 ms 2432 KB Output is correct
28 Correct 4 ms 2432 KB Output is correct
29 Correct 6 ms 2432 KB Output is correct
30 Correct 5 ms 2432 KB Output is correct
31 Correct 82 ms 2688 KB Output is correct
32 Correct 6 ms 2432 KB Output is correct
33 Correct 4 ms 2432 KB Output is correct
34 Correct 8 ms 2432 KB Output is correct
35 Correct 64 ms 3200 KB Output is correct
36 Correct 49 ms 3136 KB Output is correct
37 Correct 290 ms 2936 KB Output is correct
38 Correct 28 ms 3192 KB Output is correct
39 Correct 215 ms 2680 KB Output is correct
40 Correct 7 ms 2688 KB Output is correct
41 Correct 13 ms 2688 KB Output is correct
42 Correct 17 ms 2944 KB Output is correct
43 Correct 18 ms 2944 KB Output is correct
44 Correct 26 ms 3192 KB Output is correct
45 Correct 24 ms 3072 KB Output is correct
46 Correct 136 ms 3664 KB Output is correct
47 Correct 28 ms 3456 KB Output is correct
48 Correct 24 ms 3340 KB Output is correct
49 Correct 152 ms 3676 KB Output is correct
50 Correct 473 ms 2608 KB Output is correct