답안 #1023831

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1023831	2024-07-15T07:20:01 Z	vjudge1	Exhibition (JOI19_ho_t2)	C++17	100 / 100	42 ms	4520 KB

joi2019_ho_t2

#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define eb emplace_back
#define task ""
#define fast ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define nx freopen (task".inp","r",stdin), freopen (task".out","w",stdout);
#define fi first
#define se second
#define pii pair <int, int>
#define tii tuple <int, int, int>
#define all(s) s.begin(), s.end()
using namespace std;

const int nmax = 1e5 + 2;
int n, m, c[nmax];

struct picture
{
    int s, v;
    bool operator < (const picture &other) const
    {
        if (v == other.v) return s > other.s;
        return v > other.v;
    };
} a[nmax];

int main()
{
    if (ifstream(task".inp")) nx
    fast

    cin >> n >> m;
    for (int i = 1; i <= n; ++i)
        cin >> a[i].s >> a[i].v;

    for (int i = 1; i <= m; ++i)
        cin >> c[i];

    sort(c + 1, c + m + 1);
    sort(a + 1, a + n + 1);

    int cur_frame = m, ans = 0;
    for (int i = 1; i <= n; ++i)
        if (cur_frame >= 1 && c[cur_frame] >= a[i].s)
            ++ans, --cur_frame;
    
    cout << ans;
}

Compilation message

joi2019_ho_t2.cpp: In function 'int main()':
joi2019_ho_t2.cpp:7:20: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
    7 | #define nx freopen (task".inp","r",stdin), freopen (task".out","w",stdout);
      |            ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
joi2019_ho_t2.cpp:30:31: note: in expansion of macro 'nx'
   30 |     if (ifstream(task".inp")) nx
      |                               ^~
joi2019_ho_t2.cpp:7:52: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
    7 | #define nx freopen (task".inp","r",stdin), freopen (task".out","w",stdout);
      |                                            ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
joi2019_ho_t2.cpp:30:31: note: in expansion of macro 'nx'
   30 |     if (ifstream(task".inp")) nx
      |                               ^~

Subtask #1
10.0 / 10.0

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

Subtask #2
40.0 / 40.0

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

Subtask #3
50.0 / 50.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	0 ms	344 KB	Output is correct
3	Correct	0 ms	344 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	344 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	1 ms	348 KB	Output is correct
21	Correct	1 ms	344 KB	Output is correct
22	Correct	1 ms	348 KB	Output is correct
23	Correct	1 ms	348 KB	Output is correct
24	Correct	1 ms	348 KB	Output is correct
25	Correct	1 ms	348 KB	Output is correct
26	Correct	1 ms	348 KB	Output is correct
27	Correct	1 ms	600 KB	Output is correct
28	Correct	1 ms	348 KB	Output is correct
29	Correct	1 ms	344 KB	Output is correct
30	Correct	1 ms	348 KB	Output is correct
31	Correct	1 ms	348 KB	Output is correct
32	Correct	1 ms	344 KB	Output is correct
33	Correct	0 ms	348 KB	Output is correct
34	Correct	1 ms	348 KB	Output is correct
35	Correct	0 ms	468 KB	Output is correct
36	Correct	1 ms	348 KB	Output is correct
37	Correct	1 ms	344 KB	Output is correct
38	Correct	36 ms	4440 KB	Output is correct
39	Correct	30 ms	4444 KB	Output is correct
40	Correct	27 ms	4504 KB	Output is correct
41	Correct	32 ms	4444 KB	Output is correct
42	Correct	33 ms	4436 KB	Output is correct
43	Correct	32 ms	4520 KB	Output is correct
44	Correct	32 ms	4440 KB	Output is correct
45	Correct	33 ms	4444 KB	Output is correct
46	Correct	32 ms	4440 KB	Output is correct
47	Correct	29 ms	3928 KB	Output is correct
48	Correct	37 ms	4084 KB	Output is correct
49	Correct	27 ms	3672 KB	Output is correct
50	Correct	26 ms	3676 KB	Output is correct
51	Correct	32 ms	4280 KB	Output is correct
52	Correct	32 ms	4436 KB	Output is correct
53	Correct	41 ms	4328 KB	Output is correct
54	Correct	27 ms	4444 KB	Output is correct
55	Correct	32 ms	4296 KB	Output is correct
56	Correct	20 ms	3160 KB	Output is correct
57	Correct	13 ms	1624 KB	Output is correct
58	Correct	25 ms	3160 KB	Output is correct
59	Correct	20 ms	3164 KB	Output is correct
60	Correct	13 ms	1828 KB	Output is correct
61	Correct	20 ms	2652 KB	Output is correct
62	Correct	32 ms	4300 KB	Output is correct
63	Correct	42 ms	4352 KB	Output is correct
64	Correct	32 ms	4428 KB	Output is correct
65	Correct	33 ms	4416 KB	Output is correct
66	Correct	33 ms	4432 KB	Output is correct
67	Correct	32 ms	4476 KB	Output is correct
68	Correct	33 ms	4436 KB	Output is correct
69	Correct	33 ms	4444 KB	Output is correct
70	Correct	33 ms	4436 KB	Output is correct
71	Correct	31 ms	4432 KB	Output is correct
72	Correct	37 ms	4344 KB	Output is correct
73	Correct	30 ms	4324 KB	Output is correct

답안 #1023831

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