답안 #99686 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
99686	2019-03-06T06:42:42 Z	kjp4155	Exhibition (JOI19_ho_t2)	C++17	100 / 100	143 ms	4408 KB

joi2019_ho_t2

#include <bits/stdc++.h>

using namespace std;

#define VA_NUM_ARGS(...) VA_NUM_ARGS_IMPL_((0,__VA_ARGS__, 6,5,4,3,2,1))
#define VA_NUM_ARGS_IMPL_(tuple) VA_NUM_ARGS_IMPL tuple
#define VA_NUM_ARGS_IMPL(_0,_1,_2,_3,_4,_5,_6,N,...) N
#define macro_dispatcher(macro, ...) macro_dispatcher_(macro, VA_NUM_ARGS(__VA_ARGS__))
#define macro_dispatcher_(macro, nargs) macro_dispatcher__(macro, nargs)
#define macro_dispatcher__(macro, nargs) macro_dispatcher___(macro, nargs)
#define macro_dispatcher___(macro, nargs) macro ## nargs
#define Debug1(a)           cout<<#a<<"="<<(a)<<"\n"
#define Debug2(a,b)         cout<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<"\n"
#define Debug3(a,b,c)       cout<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<", "<<#c<<"="<<(c)<<"\n"
#define Debug4(a,b,c,d)     cout<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<", "<<#c<<"="<<(c)<<", "<<#d<<"="<<(d)<<"\n"
#define Debug5(a,b,c,d,e)   cout<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<", "<<#c<<"="<<(c)<<", "<<#d<<"="<<(d)<<", "<<#e<<"="<<(e)<<"\n"
#define Debug6(a,b,c,d,e,f) cout<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<", "<<#c<<"="<<(c)<<", "<<#d<<"="<<(d)<<", "<<#e<<"="<<(e)<<", "<<#f<<"="<<(f)<<"\n"
#define Debug(...) macro_dispatcher(Debug, __VA_ARGS__)(__VA_ARGS__)
#define DA(a,s,n) cout<<#a<<"=["; printarray(a,s,n); cout<<"]\n"

#define TT1 template<class T>
#define TT1T2 template<class T1, class T2>
#define TT1T2T3 template<class T1, class T2, class T3>
template<class T, size_t N> ostream& operator << (ostream& os, const array<T, N>& v);
TT1T2 ostream& operator << (ostream& os, const pair<T1, T2>& p){ return os <<"("<<p.first<<", "<< p.second<<")"; }
TT1 ostream& operator << (ostream& os, const vector<T>& v){       bool f=1;os<<"[";for(auto& i : v) { if (!f)os << ", ";os<<i;f=0;}return os << "]"; }
template<class T, size_t N> ostream& operator << (ostream& os, const array<T, N>& v) {     bool f=1;os<<"[";for(auto& i : v) { if (!f)os << ", ";os<<i;f=0;}return os << "]"; }
TT1T2 ostream& operator << (ostream& os, const set<T1, T2>&v){    bool f=1;os<<"[";for(auto& i : v) { if (!f)os << ", ";os<<i;f=0;}return os << "]"; }
TT1T2 ostream& operator << (ostream& os, const multiset<T1,T2>&v){bool f=1;os<<"[";for(auto& i : v) { if (!f)os << ", ";os<<i;f=0;}return os << "]"; }
TT1T2T3 ostream& operator << (ostream& os, const map<T1,T2,T3>& v){ bool f = 1; os << "["; for (auto& ii : v) { if (!f)os << ", "; os << "(" << ii.first << " -> " << ii.second << ") "; f = 0; }return os << "]"; }
TT1T2 ostream& operator << (ostream& os, const multimap<T1, T2>& v){ bool f = 1; os << "["; for (auto& ii : v) { if (!f)os << ", "; os << "(" << ii.first << " -> " << ii.second << ") "; f = 0; }return os << "]"; }
TT1T2 ostream& operator << (ostream& os, priority_queue<T1, T2> v) { bool f = 1; os << "["; while (!v.empty()) { auto x = v.top(); v.pop(); if (!f) os << ", "; f = 0; os << x; } return os << "]"; }
TT1T2 void printarray(const T1& a, T2 l, T2 r){ for (T2 i = l; i<=r; i++) cout << a[i] << (i<r?" ":""); }

void cio(){
    ios::sync_with_stdio(false);
    cin.tie(NULL);
    //cout << setprecision(15);
}

#define tt() printf("%.4f sec\n", (double) clock() / CLOCKS_PER_SEC )

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define Fi first
#define Se second
#define pb(x) push_back(x)
#define sz(x) (int)x.size()
#define rep(i, n) for(int i=0;i<n;i++)
#define repp(i, n) for(int i=1;i<=n;i++)
#define all(x) x.begin(), x.end()
#define geti1(X) cin >> X
#define geti2(X,Y) cin >> X >> Y
#define geti3(X,Y,Z) cin >> X >> Y >> Z
#define geti4(X,Y,Z,W) cin >> X >> Y >> Z >> W
#define GET_MACRO(_1,_2,_3,_4,NAME,...) NAME
#define geti(...) GET_MACRO(__VA_ARGS__, geti4, geti3, geti2, geti1) (__VA_ARGS__)

#define endl '\n'

typedef tuple<int,int,int> t3;
typedef tuple<int,int,int,int> t4;
void die(){printf("-1\n"); exit(0);}
int xx[8] = {1,-1,0,0,1,1,-1,-1}, yy[8] = {0,0,1,-1,1,-1,1,-1};
const ll mod = 1e9+7;
int N,M;
struct Node{
    int x,y,t; 
};
vector<Node> v;
int d[500500];
int mx[500500];
int main(){
    scanf("%d%d",&N,&M);
    repp(i,N){
        int x,y; scanf("%d%d",&x,&y);
        v.push_back({x,y,0});
    }
    repp(i,M) {
        int x; scanf("%d",&x);
        v.push_back({x,2000000000,1});
    }
    int timer = 0;
    sort(all(v), [](Node a, Node b)->bool{
        if( a.x != b.x ) return a.x < b.x;
        if( a.y != b.y ) return a.y < b.y;
        return a.t < b.t;
    });

    for(auto& e : v) e.x = ++timer;
    
    sort(all(v), [](Node a, Node b)->bool{
        if( a.y != b.y ) return a.y < b.y;
        if( a.x != b.x ) return a.x < b.x;
        return a.t < b.t;
    });
    timer = 0;
    for(auto& e : v) if( e.y <= 1e9+100) e.y = ++timer;

    sort(all(v), [](Node a, Node b)->bool{
        if( a.x != b.x ) return a.x < b.x;
        if( a.y != b.y ) return a.y < b.y;
        return a.t < b.t;
    });
    vector<int> tlist;    
    int cnt = 0;
    for(auto e : v){
        int x = e.x ,y = e.y ,t = e.t;
        if( t == 0 ){
            tlist.push_back(y);
        }
        else{
            for(auto p : tlist) d[p] = M-cnt;
            tlist.clear();
            ++cnt;
        }
    }
    
    for(int i=1;i<=N;i++) mx[i] = max(mx[i-1], d[i]);

    int ans = 0;
    for(int i=N;i>=1;i--){
        if( d[i] > ans ){
            ans++;
        }
    }
    printf("%d\n",ans);
}

Compilation message

joi2019_ho_t2.cpp: In function 'int main()':
joi2019_ho_t2.cpp:111:13: warning: unused variable 'x' [-Wunused-variable]
         int x = e.x ,y = e.y ,t = e.t;
             ^
joi2019_ho_t2.cpp:77:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d",&N,&M);
     ~~~~~^~~~~~~~~~~~~~
joi2019_ho_t2.cpp:79:23: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         int x,y; scanf("%d%d",&x,&y);
                  ~~~~~^~~~~~~~~~~~~~
joi2019_ho_t2.cpp:83:21: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         int x; scanf("%d",&x);
                ~~~~~^~~~~~~~~

Subtask #1
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	256 KB	Output is correct
2	Correct	2 ms	384 KB	Output is correct
3	Correct	2 ms	256 KB	Output is correct
4	Correct	2 ms	256 KB	Output is correct
5	Correct	2 ms	384 KB	Output is correct
6	Correct	2 ms	256 KB	Output is correct
7	Correct	2 ms	356 KB	Output is correct
8	Correct	2 ms	384 KB	Output is correct
9	Correct	2 ms	256 KB	Output is correct
10	Correct	2 ms	384 KB	Output is correct
11	Correct	3 ms	256 KB	Output is correct
12	Correct	3 ms	384 KB	Output is correct
13	Correct	2 ms	384 KB	Output is correct
14	Correct	3 ms	256 KB	Output is correct
15	Correct	3 ms	384 KB	Output is correct
16	Correct	2 ms	384 KB	Output is correct
17	Correct	2 ms	384 KB	Output is correct
18	Correct	2 ms	384 KB	Output is correct
19	Correct	2 ms	384 KB	Output is correct

Subtask #2
40.0 / 40.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	256 KB	Output is correct
2	Correct	2 ms	384 KB	Output is correct
3	Correct	2 ms	256 KB	Output is correct
4	Correct	2 ms	256 KB	Output is correct
5	Correct	2 ms	384 KB	Output is correct
6	Correct	2 ms	256 KB	Output is correct
7	Correct	2 ms	356 KB	Output is correct
8	Correct	2 ms	384 KB	Output is correct
9	Correct	2 ms	256 KB	Output is correct
10	Correct	2 ms	384 KB	Output is correct
11	Correct	3 ms	256 KB	Output is correct
12	Correct	3 ms	384 KB	Output is correct
13	Correct	2 ms	384 KB	Output is correct
14	Correct	3 ms	256 KB	Output is correct
15	Correct	3 ms	384 KB	Output is correct
16	Correct	2 ms	384 KB	Output is correct
17	Correct	2 ms	384 KB	Output is correct
18	Correct	2 ms	384 KB	Output is correct
19	Correct	2 ms	384 KB	Output is correct
20	Correct	3 ms	384 KB	Output is correct
21	Correct	3 ms	384 KB	Output is correct
22	Correct	3 ms	384 KB	Output is correct
23	Correct	3 ms	384 KB	Output is correct
24	Correct	4 ms	384 KB	Output is correct
25	Correct	3 ms	384 KB	Output is correct
26	Correct	3 ms	384 KB	Output is correct
27	Correct	4 ms	384 KB	Output is correct
28	Correct	4 ms	384 KB	Output is correct
29	Correct	3 ms	384 KB	Output is correct
30	Correct	3 ms	384 KB	Output is correct
31	Correct	3 ms	384 KB	Output is correct
32	Correct	3 ms	384 KB	Output is correct
33	Correct	3 ms	384 KB	Output is correct
34	Correct	4 ms	384 KB	Output is correct
35	Correct	2 ms	384 KB	Output is correct
36	Correct	3 ms	384 KB	Output is correct
37	Correct	3 ms	384 KB	Output is correct

Subtask #3
50.0 / 50.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	256 KB	Output is correct
2	Correct	2 ms	384 KB	Output is correct
3	Correct	2 ms	256 KB	Output is correct
4	Correct	2 ms	256 KB	Output is correct
5	Correct	2 ms	384 KB	Output is correct
6	Correct	2 ms	256 KB	Output is correct
7	Correct	2 ms	356 KB	Output is correct
8	Correct	2 ms	384 KB	Output is correct
9	Correct	2 ms	256 KB	Output is correct
10	Correct	2 ms	384 KB	Output is correct
11	Correct	3 ms	256 KB	Output is correct
12	Correct	3 ms	384 KB	Output is correct
13	Correct	2 ms	384 KB	Output is correct
14	Correct	3 ms	256 KB	Output is correct
15	Correct	3 ms	384 KB	Output is correct
16	Correct	2 ms	384 KB	Output is correct
17	Correct	2 ms	384 KB	Output is correct
18	Correct	2 ms	384 KB	Output is correct
19	Correct	2 ms	384 KB	Output is correct
20	Correct	3 ms	384 KB	Output is correct
21	Correct	3 ms	384 KB	Output is correct
22	Correct	3 ms	384 KB	Output is correct
23	Correct	3 ms	384 KB	Output is correct
24	Correct	4 ms	384 KB	Output is correct
25	Correct	3 ms	384 KB	Output is correct
26	Correct	3 ms	384 KB	Output is correct
27	Correct	4 ms	384 KB	Output is correct
28	Correct	4 ms	384 KB	Output is correct
29	Correct	3 ms	384 KB	Output is correct
30	Correct	3 ms	384 KB	Output is correct
31	Correct	3 ms	384 KB	Output is correct
32	Correct	3 ms	384 KB	Output is correct
33	Correct	3 ms	384 KB	Output is correct
34	Correct	4 ms	384 KB	Output is correct
35	Correct	2 ms	384 KB	Output is correct
36	Correct	3 ms	384 KB	Output is correct
37	Correct	3 ms	384 KB	Output is correct
38	Correct	120 ms	3628 KB	Output is correct
39	Correct	109 ms	3680 KB	Output is correct
40	Correct	105 ms	3568 KB	Output is correct
41	Correct	115 ms	3620 KB	Output is correct
42	Correct	101 ms	4068 KB	Output is correct
43	Correct	102 ms	4112 KB	Output is correct
44	Correct	105 ms	3564 KB	Output is correct
45	Correct	119 ms	3560 KB	Output is correct
46	Correct	99 ms	3560 KB	Output is correct
47	Correct	94 ms	3568 KB	Output is correct
48	Correct	143 ms	3564 KB	Output is correct
49	Correct	92 ms	3512 KB	Output is correct
50	Correct	89 ms	3564 KB	Output is correct
51	Correct	105 ms	4012 KB	Output is correct
52	Correct	95 ms	3920 KB	Output is correct
53	Correct	107 ms	4200 KB	Output is correct
54	Correct	77 ms	4408 KB	Output is correct
55	Correct	114 ms	3560 KB	Output is correct
56	Correct	73 ms	2792 KB	Output is correct
57	Correct	41 ms	2040 KB	Output is correct
58	Correct	60 ms	2504 KB	Output is correct
59	Correct	64 ms	2412 KB	Output is correct
60	Correct	50 ms	2040 KB	Output is correct
61	Correct	68 ms	3520 KB	Output is correct
62	Correct	139 ms	3684 KB	Output is correct
63	Correct	115 ms	3628 KB	Output is correct
64	Correct	126 ms	3664 KB	Output is correct
65	Correct	112 ms	3616 KB	Output is correct
66	Correct	116 ms	3564 KB	Output is correct
67	Correct	113 ms	3636 KB	Output is correct
68	Correct	119 ms	3684 KB	Output is correct
69	Correct	128 ms	3624 KB	Output is correct
70	Correct	108 ms	3564 KB	Output is correct
71	Correct	130 ms	3688 KB	Output is correct
72	Correct	111 ms	3620 KB	Output is correct
73	Correct	105 ms	3564 KB	Output is correct

답안 #99686

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 40.0 / 40.0

Subtask #3 50.0 / 50.0

Subtask #1
10.0 / 10.0

Subtask #2
40.0 / 40.0

Subtask #3
50.0 / 50.0