답안 #64395 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
64395	2018-08-04T09:37:16 Z	grumpy_gordon	Golf (JOI17_golf)	C++17	100 / 100	1792 ms	236856 KB

golf

/*
                     .:*+=%@@@@@@=-.
                 .:=@#@@@#@@#######%==*.
              .-=####@######%*-.....:%##%.
            .*@###########%+:   --........-%@-
          .*@##############@+--.........-:%-
        .+##################@==%%%%=+*:----+.
      .-@####################%++%@@@@@=+**%@@*
      .%###################@%%@@@###@%+:--%@@%.
     -@###################@%%%%*::*%++:-----=@+.
    -#####################@%=++++++*:-------.-=:
   .+####################@%++*::-:::--::*:::***=:
   .@#####################%=++*::::-:::++*=##@@#@-
  ..#####################@%%=++**:::::**+%@#@%%##-..
   .%####################@@%=+++*+****::*=@######@.
  .=######################@%%==+==++**+=@%@##@###+:...
  -#######################@@@%%%===++=@@@%=++===*::--...
  -########################@@@@@@@%==%%=++==@@:::::*:--.
..:#########################@@@@@@%%======++++::-..:-.--...
%#############################@###@%%@@%==%=%*----.--.::---.
#############################################*-:*:-:---*---- .
#############################################*--*--:---*---:-.
#############################################+--::--::-*::-::.
###########################################+:*-.---.---.:---*-..
###########################################**:-----------------.
##########################################@::**:--::::::--:::::-
###########################################:--:*:::::::::**::*+*
###########################################=:::***::::::**:::*+*
############################@@@@@@#########@+****::::********+++
############################@%%%%%@@@@@@@###%+***::::::::***+==+
############################@%%%%%%%%%%%@####=+:::-::::-::*+=%%+
#############################@%%%%%%%%%%@#####=::--------:*=%@%+
%###########################@%%%%==%%%%%%@##@#=:------..-:+%@@%=
----------------------------------------------
--------------------------------------------
----------------------------------------------
--------------------------------------------
----------------------------------------------

         o###########oo
      o##"          ""##o
    o#"                "##
  o#"                    "#o
 #"  ##              ##   "##
#"                          ##
#  ###################       #
#                            #
#                            #
#                            #
#                            #
#                            #
#                            #
#o                           #
"#o                         ##
 "#o                       ##
  "#o                    o#"
   "#o                  ##
     "#o              o#"
       "#ooo      ooo#######oo
        ###############   "######o
     o###""        "###o      # ###
   o###o     oooo    ###    oo####"
 o###**#     #**#   ############"
 ""##""""""""""###########    #
    # oooooooo#"#**     ##    #
    # #       # # **    ##    #
    #o#       #o#  *****###ooo#
                        ##
                        ##   o###o
                        ## o##***##
               o########## #***#**##o
             o##"   ""###  #***##***#
 o#######o  ###   oo####   ##**####*#
o##"  ""#############""     ##****###
##"         ##              ##*##*###
##          ###              ##### ##
##           ###              # ##  #
##            ##                 #
##             ##
##             ###
##              ###oo
###              ""###
 ###
  ###
*/

///YEAH IM THE BEST I'VE EVER WAS

///SO HAPPY

#include <bits/stdc++.h>

#define fr first

#define sc second

#define m_p make_pair

//#include <ext/pb_ds/assoc_container.hpp>

//using namespace __gnu_pbds;

//gp_hash_table<int, int> table;

//#pragma GCC optimize("O3")
//#pragma GCC optimize("Ofast,no-stack-protector")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx")
//#pragma GCC target("avx,tune=native")
//float __attribute__((aligned(32)))

/*char memory[(int)1e8];

char memorypos;

inline void * operator new(size_t n){
    char * ret = memory + memorypos;
    memorypos += n;
    return (void *)ret;
}

inline void operator delete(void *){}
*/

using namespace std;

typedef long long ll;

typedef unsigned long long ull;

typedef long double ld;

typedef unsigned int uint;

ll sqr(ll x){
    return x * x;
}

int mysqrt(ll x){
    int l = 0, r = 1e9 + 1;
    while (r - l > 1){
        int m = (l + r) / 2;
        if (m * (ll)m <= x)
            l = m;
        else
            r = m;
    }
    return l;
}

mt19937 rnd(1227);

mt19937_64 rndll(12365);

ll AR = 19, BR = 13, CR = 23, XR = 228, YR = 322, MODR = 1e9 + 993;

ll myrand(){
    ll ZR = (XR * AR + YR * BR + CR) % MODR;
    XR = YR;
    YR = ZR;
    return ZR;
}

int gcd(int a, int b){
    return a ? gcd(b % a, a) : b;
}

int gcdex(int a, int b, int &x, int &y){
    if (a == 0){
        x = 0;
        y = 1;
        return b;
    }
    int x1, y1;
    int ret = gcdex(b % a, a, x1, y1);
    x = y1 - (b / a) * x1;
    y = x1;
    return ret;
}

const int Mod = 1e9 + 7;

int Bpow(int x, int y){
    int ret = 1;
    int w = x;
    while (y){
        if (y & 1)
            ret = (ret * (ll)w) % Mod;
        w = (w * (ll)w) % Mod;
        y >>= 1;
    }
    return ret;
}

int Bdiv(int x){
    int a, b;
    gcdex(x, Mod, a, b);
    if (a < 0)
        a += Mod;
    return a;
}

int Bdiv(int x, int y){
    return (x * (ll)Bpow(y, Mod - 2)) % Mod;
}

void setmin(int &x, int y){
    x = min(x, y);
}

void setmax(int &x, int y){
    x = max(x, y);
}

void setmin(ll &x, ll y){
    x = min(x, y);
}

void setmax(ll &x, ll y){
    x = max(x, y);
}

const ll llinf = 2e18 + 100;

const double eps = 1e-9;

const int maxn = 4e5 + 100, maxw = 1e6 + 100, inf = 2e9 + 100, sq = 300, mod = 1e9 + 7, LG = 17;


struct seg_tree{
    bool v;
    int l, r;
};

seg_tree p[maxn * 50];

int cnt;

int create(){
    return cnt++;
}

int build(int l, int r){
    int t = create();
    if (l == r)
        return t;
    int m = (l + r) / 2;
    p[t].l = build(l, m);
    p[t].r = build(m + 1, r);
    return t;
}

int update(int now, int l, int r, int id, int w){
    int t = create();
    if (l == r){
        p[t].v = w;
        return t;
    }
    int m = (l + r) / 2;
    if (id <= m)
        p[t].l = update(p[now].l, l, m, id, w),
        p[t].r = p[now].r;
    else
        p[t].l = p[now].l,
        p[t].r = update(p[now].r, m + 1, r, id, w);
    p[t].v = (p[p[t].l].v | p[p[t].r].v);
    return t;
}

void get(int t, int tl, int tr, int l, int r, vector<int> &h){
    if (l > r || !p[t].v)
        return;
    if (tl == tr){
        h.push_back(l);
        p[t].v = 0;
        return;
    }
    int m = (tl + tr) / 2;
    get(p[t].l, tl, m, l, min(r, m), h);
    get(p[t].r, m + 1, tr, max(l, m + 1), r, h);
    p[t].v = (p[p[t].l].v | p[p[t].r].v);
}

pair<int, int> start, finish;

int n;

pair<pair<int, int>, pair<int, int> > rec[maxn];

map<int, int> mpik;

vector<int> srt;

vector<pair<int, pair<int, int> > > seg[2];

int d[maxn];

int q[maxn];

pair<int, int> bo[maxn];

int main()
{
    #ifdef ONPC
    //ifstream cin("a.in");
    //ofstream cout("a.out");
    freopen("a.in", "r", stdin);
    freopen("a.out", "w", stdout);
    #else
    //ifstream cin("gymnasts.in");
    //ofstream cout("gymnasts.out");
    //freopen("sort.in", "r", stdin);
    //freopen("sort.out", "w", stdout);
    #endif // ONPC
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin >> start.fr >> start.sc >> finish.fr >> finish.sc;
    cin >> n;
    for (int i = 0; i < n; i++)
        cin >> rec[i].fr.fr >> rec[i].fr.sc >> rec[i].sc.fr >> rec[i].sc.sc;
    /*for (int t = 0; t < 2; t++){
        for (int i = 0; i < n; i++)
            srt.push_back(rec[i].fr.fr),
            srt.push_back(rec[i].fr.sc);
        srt.push_back(start.fr);
        srt.push_back(finish.fr);
        sort(srt.begin(), srt.end());
        srt.resize(unique(srt.begin(), srt.end()) - srt.begin());
        for (int i : srt)
            mpik[i] = mpik.size() - 1;
        for (int i = 0; i < n; i++)
            rec[i].fr.fr = mpik[rec[i].fr.fr],
            rec[i].fr.sc = mpik[rec[i].fr.sc];
        start.fr = mpik[start.fr];
        finish.fr = mpik[finish.fr];
        srt.clear();
        mpik.clear();
        for (int i = 0; i < n; i++)
            swap(rec[i].fr, rec[i].sc);
        swap(start.fr, start.sc);
        swap(finish.fr, finish.sc);
    }*/
    for (int t = 0; t < 2; t++){
        vector<pair<int, pair<int, int> > > que;
        for (int i = 0; i < n; i++)
            que.push_back(m_p(rec[i].sc.fr, rec[i].fr)),
            que.push_back(m_p(rec[i].sc.sc, rec[i].fr)),
            que.push_back(m_p(rec[i].sc.fr, m_p(inf, rec[i].fr.fr))),
            que.push_back(m_p(rec[i].sc.fr, m_p(inf, rec[i].fr.sc))),
            que.push_back(m_p(rec[i].sc.sc, m_p(-inf, rec[i].fr.fr))),
            que.push_back(m_p(rec[i].sc.sc, m_p(-inf, rec[i].fr.sc))),
            swap(rec[i].fr, rec[i].sc);
        que.push_back(m_p(start.sc, m_p(start.fr, start.fr)));
        que.push_back(m_p(finish.sc, m_p(finish.fr, finish.fr)));
        swap(start.fr, start.sc);
        swap(finish.fr, finish.sc);
        sort(que.begin(), que.end());
        set<int> st;
        st.insert(-1);
        st.insert(inf);
        for (auto its : que)
        if (its.sc.fr == -inf)
            st.erase(its.sc.sc);
        else
        if (its.sc.fr == inf)
            st.insert(its.sc.sc);
        else{
            set<int> :: iterator it = st.upper_bound(its.sc.fr);
            it--;
            int le = *it;
            it = st.lower_bound(its.sc.sc);
            seg[t].push_back(m_p(its.fr, m_p(le, *it)));
        }
        sort(seg[t].begin(), seg[t].end());
        seg[t].resize(unique(seg[t].begin(), seg[t].end()) - seg[t].begin());
    }
    n = seg[0].size() + seg[1].size();
    assert(n < maxn);
    for (int t = 0; t < 2; t++){
        for (int i = 0; i < seg[t].size(); i++){
            int l = lower_bound(seg[!t].begin(), seg[!t].end(), m_p(seg[t][i].sc.fr, m_p(-inf, -inf))) - seg[!t].begin();
            int r = upper_bound(seg[!t].begin(), seg[!t].end(), m_p(seg[t][i].sc.sc, m_p(inf, inf))) - seg[!t].begin() - 1;
            if (!t)
                l += seg[0].size(), r += seg[0].size();
            bo[i + t * seg[0].size()] = m_p(l, r);
        }
        vector<pair<int, pair<int, int> > > que;
        for (int i = 0; i < seg[t].size(); i++)
            que.push_back(m_p(seg[t][i].fr, m_p(i + t * seg[0].size(), 0)));
        for (int i = 0; i < seg[!t].size(); i++)
            que.push_back(m_p(seg[!t][i].sc.fr, m_p(-inf, i + !t * seg[0].size()))),
            que.push_back(m_p(seg[!t][i].sc.sc, m_p(inf, i + !t * seg[0].size())));
        sort(que.begin(), que.end());
        int now = build(0, n - 1);
        for (auto its : que)
        if (its.sc.fr == -inf)
            now = update(now, 0, n - 1, its.sc.sc, 1);
        else
        if (its.sc.fr == inf)
            now = update(now, 0, n - 1, its.sc.sc, 0);
        else
            q[its.sc.fr] = now;
    }
    for (int i = 0; i < n; i++)
        d[i] = -1;
    int sta, stb, fina, finb;
    for (int i = 0; i < seg[0].size(); i++)
    if (seg[0][i].fr == start.sc && seg[0][i].sc.fr <= start.fr && seg[0][i].sc.sc >= start.fr)
        sta = i;
    for (int i = 0; i < seg[1].size(); i++)
    if (seg[1][i].fr == start.fr && seg[1][i].sc.fr <= start.sc && seg[1][i].sc.sc >= start.sc)
        stb = seg[0].size() + i;
    for (int i = 0; i < seg[0].size(); i++)
    if (seg[0][i].fr == finish.sc && seg[0][i].sc.fr <= finish.fr && seg[0][i].sc.sc >= finish.fr)
        fina = i;
    for (int i = 0; i < seg[1].size(); i++)
    if (seg[1][i].fr == finish.fr && seg[1][i].sc.fr <= finish.sc && seg[1][i].sc.sc >= finish.sc)
        finb = seg[0].size() + i;
    d[sta] = 0;
    d[stb] = 0;
    queue<int> que;
    que.push(sta);
    que.push(stb);
    while (!que.empty()){
        int id = que.front();
        que.pop();
        if (id == fina || id == finb){
            cout << d[id] + 1;
            return 0;
        }
        vector<int> g;
        get(q[id], 0, n - 1, bo[id].fr, bo[id].sc, g);
        for (int i : g)
        if (d[i] == -1)
            d[i] = d[id] + 1, que.push(i);
    }
    assert(0);
}

Compilation message

golf.cpp: In function 'int main()':
golf.cpp:380:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int i = 0; i < seg[t].size(); i++){
                         ~~^~~~~~~~~~~~~~~
golf.cpp:388:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int i = 0; i < seg[t].size(); i++)
                         ~~^~~~~~~~~~~~~~~
golf.cpp:390:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int i = 0; i < seg[!t].size(); i++)
                         ~~^~~~~~~~~~~~~~~~
golf.cpp:407:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < seg[0].size(); i++)
                     ~~^~~~~~~~~~~~~~~
golf.cpp:410:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < seg[1].size(); i++)
                     ~~^~~~~~~~~~~~~~~
golf.cpp:413:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < seg[0].size(); i++)
                     ~~^~~~~~~~~~~~~~~
golf.cpp:416:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < seg[1].size(); i++)
                     ~~^~~~~~~~~~~~~~~
golf.cpp:427:16: warning: 'fina' may be used uninitialized in this function [-Wmaybe-uninitialized]
         if (id == fina || id == finb){
             ~~~^~~~~~~
golf.cpp:427:30: warning: 'finb' may be used uninitialized in this function [-Wmaybe-uninitialized]
         if (id == fina || id == finb){
                           ~~~^~~~~~~

Subtask #1
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	384 KB	Output is correct
2	Correct	6 ms	384 KB	Output is correct
3	Correct	5 ms	384 KB	Output is correct
4	Correct	6 ms	512 KB	Output is correct
5	Correct	15 ms	1780 KB	Output is correct
6	Correct	12 ms	1776 KB	Output is correct
7	Correct	15 ms	1780 KB	Output is correct
8	Correct	16 ms	1776 KB	Output is correct
9	Correct	14 ms	1780 KB	Output is correct
10	Correct	13 ms	1780 KB	Output is correct
11	Correct	14 ms	1780 KB	Output is correct
12	Correct	12 ms	1976 KB	Output is correct
13	Correct	12 ms	1752 KB	Output is correct
14	Correct	13 ms	1824 KB	Output is correct
15	Correct	7 ms	768 KB	Output is correct
16	Correct	8 ms	1148 KB	Output is correct

Subtask #2
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	384 KB	Output is correct
2	Correct	6 ms	384 KB	Output is correct
3	Correct	5 ms	384 KB	Output is correct
4	Correct	6 ms	512 KB	Output is correct
5	Correct	15 ms	1780 KB	Output is correct
6	Correct	12 ms	1776 KB	Output is correct
7	Correct	15 ms	1780 KB	Output is correct
8	Correct	16 ms	1776 KB	Output is correct
9	Correct	14 ms	1780 KB	Output is correct
10	Correct	13 ms	1780 KB	Output is correct
11	Correct	14 ms	1780 KB	Output is correct
12	Correct	12 ms	1976 KB	Output is correct
13	Correct	12 ms	1752 KB	Output is correct
14	Correct	13 ms	1824 KB	Output is correct
15	Correct	7 ms	768 KB	Output is correct
16	Correct	8 ms	1148 KB	Output is correct
17	Correct	14 ms	2012 KB	Output is correct
18	Correct	12 ms	2036 KB	Output is correct
19	Correct	14 ms	2036 KB	Output is correct
20	Correct	15 ms	2020 KB	Output is correct
21	Correct	14 ms	2012 KB	Output is correct
22	Correct	13 ms	2128 KB	Output is correct
23	Correct	13 ms	2020 KB	Output is correct
24	Correct	16 ms	2024 KB	Output is correct
25	Correct	13 ms	2020 KB	Output is correct
26	Correct	14 ms	2020 KB	Output is correct
27	Correct	7 ms	768 KB	Output is correct
28	Correct	10 ms	1252 KB	Output is correct
29	Correct	9 ms	1152 KB	Output is correct

Subtask #3
70.0 / 70.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	384 KB	Output is correct
2	Correct	6 ms	384 KB	Output is correct
3	Correct	5 ms	384 KB	Output is correct
4	Correct	6 ms	512 KB	Output is correct
5	Correct	15 ms	1780 KB	Output is correct
6	Correct	12 ms	1776 KB	Output is correct
7	Correct	15 ms	1780 KB	Output is correct
8	Correct	16 ms	1776 KB	Output is correct
9	Correct	14 ms	1780 KB	Output is correct
10	Correct	13 ms	1780 KB	Output is correct
11	Correct	14 ms	1780 KB	Output is correct
12	Correct	12 ms	1976 KB	Output is correct
13	Correct	12 ms	1752 KB	Output is correct
14	Correct	13 ms	1824 KB	Output is correct
15	Correct	7 ms	768 KB	Output is correct
16	Correct	8 ms	1148 KB	Output is correct
17	Correct	14 ms	2012 KB	Output is correct
18	Correct	12 ms	2036 KB	Output is correct
19	Correct	14 ms	2036 KB	Output is correct
20	Correct	15 ms	2020 KB	Output is correct
21	Correct	14 ms	2012 KB	Output is correct
22	Correct	13 ms	2128 KB	Output is correct
23	Correct	13 ms	2020 KB	Output is correct
24	Correct	16 ms	2024 KB	Output is correct
25	Correct	13 ms	2020 KB	Output is correct
26	Correct	14 ms	2020 KB	Output is correct
27	Correct	7 ms	768 KB	Output is correct
28	Correct	10 ms	1252 KB	Output is correct
29	Correct	9 ms	1152 KB	Output is correct
30	Correct	1240 ms	232128 KB	Output is correct
31	Correct	1676 ms	232136 KB	Output is correct
32	Correct	1752 ms	234548 KB	Output is correct
33	Correct	1792 ms	234472 KB	Output is correct
34	Correct	1349 ms	236788 KB	Output is correct
35	Correct	1722 ms	236780 KB	Output is correct
36	Correct	1323 ms	236740 KB	Output is correct
37	Correct	1559 ms	236856 KB	Output is correct
38	Correct	1351 ms	236800 KB	Output is correct
39	Correct	1482 ms	236796 KB	Output is correct
40	Correct	668 ms	231988 KB	Output is correct
41	Correct	673 ms	232256 KB	Output is correct
42	Correct	657 ms	234360 KB	Output is correct
43	Correct	655 ms	234360 KB	Output is correct
44	Correct	695 ms	236740 KB	Output is correct
45	Correct	729 ms	236732 KB	Output is correct
46	Correct	675 ms	236724 KB	Output is correct
47	Correct	767 ms	236788 KB	Output is correct
48	Correct	762 ms	236788 KB	Output is correct
49	Correct	650 ms	236744 KB	Output is correct
50	Correct	9 ms	1148 KB	Output is correct
51	Correct	9 ms	1276 KB	Output is correct
52	Correct	10 ms	1252 KB	Output is correct

답안 #64395

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 20.0 / 20.0

Subtask #3 70.0 / 70.0

Subtask #1
10.0 / 10.0

Subtask #2
20.0 / 20.0

Subtask #3
70.0 / 70.0