oj.uz

답안 #97420

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
97420 2019-02-15T23:39:02 Z silxikys Exhibition (JOI19_ho_t2) C++14
50 / 100
 1000 ms 6580 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

const int maxn = 1e5+5;
int N, M;
int frames[maxn];
int dp[maxn];
int lastused[maxn];

int main()
{
    cin >> N >> M;
    vector<pair<int,int>> pictures;
    for (int i = 0; i < N; i++) {
        int a, b; cin >> a >> b;
        pictures.push_back({a,b});
    }
    //coordinate compress values
    sort(pictures.begin(),pictures.end(),[](auto a, auto b) {
            return a.second < b.second;
            });
    map<int,int> comp;
    int c = 1;
    for (auto& p: pictures) {
        if (comp.count(p.second)) p.second = comp[p.second];
        else p.second = comp[p.second] = c++;
    }
    sort(pictures.begin(),pictures.end(),[](auto a, auto b) {
            if (a.second != b.second) return a.second < b.second;
            return a.first < b.first;
            });
    for (int i = 1; i <= M; i++) cin >> frames[i];
    sort(frames+1,frames+M+1);

    int ans = 0;            
    for (int i = N - 1; i >= 0; i--) {
        int sz = pictures[i].first;
        int val = pictures[i].second;
        if (frames[M] >= sz) dp[i] = 1;
        for (int j = i + 1; j < N; j++) {
            if (dp[j] < M && frames[M-dp[j]] >= sz) {
                dp[i] = max(dp[i],dp[j]+1);
            }
        }
        //cout << i << ": " << dp[i] << '\n';
        ans = max(ans,dp[i]);
    }
    cout << ans << '\n';
}

Compilation message

joi2019_ho_t3.cpp: In function 'int main()':
joi2019_ho_t3.cpp:39:13: warning: unused variable 'val' [-Wunused-variable]
         int val = pictures[i].second;
             ^~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 3 ms 384 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 2 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 3 ms 384 KB Output is correct
14 Correct 3 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 3 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 3 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 3 ms 384 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 2 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 3 ms 384 KB Output is correct
14 Correct 3 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 3 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 4 ms 384 KB Output is correct
21 Correct 4 ms 384 KB Output is correct
22 Correct 5 ms 384 KB Output is correct
23 Correct 4 ms 384 KB Output is correct
24 Correct 4 ms 384 KB Output is correct
25 Correct 4 ms 384 KB Output is correct
26 Correct 4 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 7 ms 384 KB Output is correct
30 Correct 5 ms 384 KB Output is correct
31 Correct 6 ms 384 KB Output is correct
32 Correct 5 ms 384 KB Output is correct
33 Correct 2 ms 384 KB Output is correct
34 Correct 6 ms 384 KB Output is correct
35 Correct 3 ms 384 KB Output is correct
36 Correct 5 ms 384 KB Output is correct
37 Correct 6 ms 384 KB Output is correct

Subtask #3
0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 3 ms 384 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 2 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 3 ms 384 KB Output is correct
14 Correct 3 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 3 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 4 ms 384 KB Output is correct
21 Correct 4 ms 384 KB Output is correct
22 Correct 5 ms 384 KB Output is correct
23 Correct 4 ms 384 KB Output is correct
24 Correct 4 ms 384 KB Output is correct
25 Correct 4 ms 384 KB Output is correct
26 Correct 4 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 7 ms 384 KB Output is correct
30 Correct 5 ms 384 KB Output is correct
31 Correct 6 ms 384 KB Output is correct
32 Correct 5 ms 384 KB Output is correct
33 Correct 2 ms 384 KB Output is correct
34 Correct 6 ms 384 KB Output is correct
35 Correct 3 ms 384 KB Output is correct
36 Correct 5 ms 384 KB Output is correct
37 Correct 6 ms 384 KB Output is correct
38 Execution timed out 1056 ms 6580 KB Time limit exceeded
39 Halted 0 ms 0 KB -