답안 #720976

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
720976	2023-04-10T01:13:58 Z	Pring	Exhibition (JOI19_ho_t2)	C++14	10 / 100	1 ms	468 KB

joi2019_ho_t2

#include <bits/stdc++.h>
using namespace std;

#define int long long
typedef pair<int, int> pii;

const int MXN = 15;
int n, m, fr[MXN], dp[MXN][MXN], lastC, ans;

struct P {
    int sz, val;
    P() {
        sz = 0;
        val = 0;
    }
    P(int _sz, int _val) {
        sz = _sz;
        val = _val;
    }
} pic[MXN];

// vector<int> ssq;

void SOLVE(int x) {
    vector<int> ssq;
    for (int i = 0; i < n; i++) {
        if (x & (1 << i)) ssq.push_back(i);
    }
    if (ssq.size() <= ans) return;
    // for (int i = 1; i < ssq.size(); i++) {
    //     if (pic[ssq[i - 1]].val > pic[ssq[i]].val) return;
    // }
    int p = 0;
    for (auto &i : ssq) {
        while (p < m && pic[i].sz > fr[p]) p++;
        if (p == m) return;
        p++;
    }
    ans = max(ans, (int) ssq.size());
}

int32_t main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cin >> n >> m;
    for (int i = 0; i < n; i++) cin >> pic[i].sz >> pic[i].val;
    for (int i = 0; i < m; i++) cin >> fr[i];
    sort(pic, pic + n, [](P &a, P &b) {
        return (a.val == b.val ? a.sz < b.sz : a.val < b.val);
    });
    sort(fr, fr + m);
    fr[m] = LLONG_MAX;
    for (int i = 0; i < (1 << n); i++) {
        SOLVE(i);
    }
    cout << ans << endl;
    return 0;
}

Compilation message

joi2019_ho_t2.cpp: In function 'void SOLVE(long long int)':
joi2019_ho_t2.cpp:29:20: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
   29 |     if (ssq.size() <= ans) return;
      |         ~~~~~~~~~~~^~~~~~

Subtask #1

10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	324 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	324 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	336 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 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	1 ms	320 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct

Subtask #2

0 / 40.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	324 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	324 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	336 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 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	1 ms	320 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Runtime error	1 ms	468 KB	Execution killed with signal 11
21	Halted	0 ms	0 KB	-

Subtask #3

0 / 50.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	324 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	324 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	336 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 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	1 ms	320 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Runtime error	1 ms	468 KB	Execution killed with signal 11
21	Halted	0 ms	0 KB	-