oj.uz

Submission #771838

# Submission time Handle Problem Language Result Execution time Memory
771838 2023-07-03T10:23:51 Z RecursiveCo Exhibition (JOI19_ho_t2) C++14
100 / 100
 41 ms 6600 KB 
// CF template, version 3.0

#include <bits/stdc++.h>

using namespace std;

#define improvePerformance ios_base::sync_with_stdio(false); cin.tie(0)
#define getTest int t; cin >> t
#define eachTest for (int _var=0;_var<t;_var++)
#define get(name) int (name); cin >> (name)
#define out(o) cout << (o)
#define getList(cnt, name) vector<int> (name); for (int _=0;_<(cnt);_++) { get(a); (name).push_back(a); }
#define sortl(name) sort((name).begin(), (name).end())
#define rev(name) reverse((name).begin(), (name).end())
#define forto(name, var) for (int (var) = 0; (var) < (name); (var)++)
#define decision(b) if (b){out("YES");}else{out("NO");}

#define int long long int

signed main() {
    improvePerformance;
    get(n);
    get(m);
    vector<pair<int, int>> photos;
    forto(n, i) {
        get(c);
        get(v);
        photos.push_back({v, c});
    }
    getList(m, frames);
    sortl(frames);
    sortl(photos);
    int ans = 0;
    int ptrp = n - 1;
    int ptrf = m - 1;
    while (ptrp >= 0 && ptrf >= 0) {
        while (ptrp >= 0 && photos[ptrp].second > frames[ptrf]) ptrp--;
        if (ptrp >= 0) ans++;
        ptrf--;
        ptrp--;
    }
    out(ans);
}

Compilation message

joi2019_ho_t2.cpp: In function 'int main()':
joi2019_ho_t2.cpp:10:23: warning: unnecessary parentheses in declaration of 'n' [-Wparentheses]
   10 | #define get(name) int (name); cin >> (name)
      |                       ^
joi2019_ho_t2.cpp:22:5: note: in expansion of macro 'get'
   22 |     get(n);
      |     ^~~
joi2019_ho_t2.cpp:10:23: warning: unnecessary parentheses in declaration of 'm' [-Wparentheses]
   10 | #define get(name) int (name); cin >> (name)
      |                       ^
joi2019_ho_t2.cpp:23:5: note: in expansion of macro 'get'
   23 |     get(m);
      |     ^~~
joi2019_ho_t2.cpp:15:35: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   15 | #define forto(name, var) for (int (var) = 0; (var) < (name); (var)++)
      |                                   ^
joi2019_ho_t2.cpp:25:5: note: in expansion of macro 'forto'
   25 |     forto(n, i) {
      |     ^~~~~
joi2019_ho_t2.cpp:10:23: warning: unnecessary parentheses in declaration of 'c' [-Wparentheses]
   10 | #define get(name) int (name); cin >> (name)
      |                       ^
joi2019_ho_t2.cpp:26:9: note: in expansion of macro 'get'
   26 |         get(c);
      |         ^~~
joi2019_ho_t2.cpp:10:23: warning: unnecessary parentheses in declaration of 'v' [-Wparentheses]
   10 | #define get(name) int (name); cin >> (name)
      |                       ^
joi2019_ho_t2.cpp:27:9: note: in expansion of macro 'get'
   27 |         get(v);
      |         ^~~
joi2019_ho_t2.cpp:12:40: warning: unnecessary parentheses in declaration of 'frames' [-Wparentheses]
   12 | #define getList(cnt, name) vector<int> (name); for (int _=0;_<(cnt);_++) { get(a); (name).push_back(a); }
      |                                        ^
joi2019_ho_t2.cpp:30:5: note: in expansion of macro 'getList'
   30 |     getList(m, frames);
      |     ^~~~~~~
joi2019_ho_t2.cpp:10:23: warning: unnecessary parentheses in declaration of 'a' [-Wparentheses]
   10 | #define get(name) int (name); cin >> (name)
      |                       ^
joi2019_ho_t2.cpp:12:76: note: in expansion of macro 'get'
   12 | #define getList(cnt, name) vector<int> (name); for (int _=0;_<(cnt);_++) { get(a); (name).push_back(a); }
      |                                                                            ^~~
joi2019_ho_t2.cpp:30:5: note: in expansion of macro 'getList'
   30 |     getList(m, frames);
      |     ^~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 316 KB Output is correct
3 Correct 1 ms 316 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 320 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 320 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 316 KB Output is correct
3 Correct 1 ms 316 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 320 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 320 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 456 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 456 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 328 KB Output is correct
34 Correct 1 ms 356 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 316 KB Output is correct
3 Correct 1 ms 316 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 320 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 320 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 456 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 456 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 328 KB Output is correct
34 Correct 1 ms 356 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 38 ms 6520 KB Output is correct
39 Correct 36 ms 6520 KB Output is correct
40 Correct 33 ms 6592 KB Output is correct
41 Correct 38 ms 6596 KB Output is correct
42 Correct 38 ms 6464 KB Output is correct
43 Correct 38 ms 6480 KB Output is correct
44 Correct 38 ms 6540 KB Output is correct
45 Correct 38 ms 6564 KB Output is correct
46 Correct 37 ms 6440 KB Output is correct
47 Correct 36 ms 5972 KB Output is correct
48 Correct 33 ms 5956 KB Output is correct
49 Correct 31 ms 5432 KB Output is correct
50 Correct 30 ms 5444 KB Output is correct
51 Correct 37 ms 6596 KB Output is correct
52 Correct 37 ms 6592 KB Output is correct
53 Correct 41 ms 6544 KB Output is correct
54 Correct 32 ms 6572 KB Output is correct
55 Correct 38 ms 6600 KB Output is correct
56 Correct 26 ms 3920 KB Output is correct
57 Correct 14 ms 2280 KB Output is correct
58 Correct 23 ms 3916 KB Output is correct
59 Correct 23 ms 3920 KB Output is correct
60 Correct 14 ms 2336 KB Output is correct
61 Correct 23 ms 3844 KB Output is correct
62 Correct 38 ms 6512 KB Output is correct
63 Correct 40 ms 6588 KB Output is correct
64 Correct 38 ms 6532 KB Output is correct
65 Correct 37 ms 6484 KB Output is correct
66 Correct 38 ms 6588 KB Output is correct
67 Correct 37 ms 6468 KB Output is correct
68 Correct 40 ms 6516 KB Output is correct
69 Correct 38 ms 6580 KB Output is correct
70 Correct 39 ms 6484 KB Output is correct
71 Correct 37 ms 6468 KB Output is correct
72 Correct 40 ms 6596 KB Output is correct
73 Correct 36 ms 6492 KB Output is correct