oj.uz

답안 #309290

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
309290 2020-10-03T06:13:32 Z georgerapeanu Jelly Flavours (IOI20_jelly) C++17
14 / 100
 102 ms 896 KB 
#include "jelly.h"
#include <vector>
#include <algorithm>

using namespace std;

const int VMAX = 1e4;

class MyContainer{
private:

    vector<pair<int,int> > aint;

    void update(int nod,int st,int dr,int pos,int val){
        if(dr < pos || st > pos){
            return ;
        }
        if(st == dr){
             aint[nod].first += val;
             aint[nod].second += val * pos;
             return ;
        }

        int mid = (st + dr) / 2;

        update(nod * 2,st,mid,pos,val);
        update(nod * 2 + 1,mid + 1,dr,pos,val);

        aint[nod].first = aint[nod * 2].first + aint[nod * 2 + 1].first;
        aint[nod].second = aint[nod * 2].second + aint[nod * 2 + 1].second;
    }

    int query(int nod,int st,int dr,int val){
        if(st == dr){
            return min(aint[nod].first,(val / st));
        }
        
        int mid = (st + dr) / 2;

        if(aint[nod * 2].second <= val){
            return aint[nod * 2].first + query(nod * 2 + 1,mid + 1,dr,val - aint[nod * 2].second);
        }
        else{
            return query(nod * 2,st,mid,val);
        }
    }

public:

    MyContainer(const vector<int> &v){
        aint = vector<pair<int,int> >(4 * (VMAX + 1) + 5,{0,0});
        for(auto it:v){
            update(1,1,VMAX,it,1);
        }
    }

    void del(int val){
        update(1,1,VMAX,val,-1);
    }

    int query(int val){
        return query(1,1,VMAX,val); 
    }
};

int find_maximum_unique(int x, int y, vector<int> a, vector<int> b) {
	int n = a.size();
    
    vector<pair<int,int> > sorted_a;

    for(int i = 0;i < n;i++){
        sorted_a.push_back({a[i],i});
    }

    sort(sorted_a.begin(),sorted_a.end());

    MyContainer stuff(b);

    vector<int> dp(VMAX + 1,0);

    int ans = 0;

    for(int i = -1;i < (int)sorted_a.size();i++){
        if(i >= 0){
            for(int j = VMAX;j >= 0;j--){
                if(j + sorted_a[i].first <= VMAX){
                    dp[j + sorted_a[i].first] = min(dp[j + sorted_a[i].first],dp[j]);
                }
                dp[j] += b[sorted_a[i].second];
            }
            stuff.del(sorted_a[i].first);
        }
        
        if(dp[x] <= y){
            ans = max(ans,(i + 1) + stuff.query(y - dp[x]));
        }
    }

	return ans;
}

Subtask #1
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 640 KB 1st lines differ - on the 1st token, expected: '8', found: '9'
2 Halted 0 ms 0 KB -

Subtask #2
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 640 KB 1st lines differ - on the 1st token, expected: '8', found: '9'
2 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 87 ms 768 KB 1st lines differ - on the 1st token, expected: '689', found: '1307'
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 61 ms 768 KB 1st lines differ - on the 1st token, expected: '62', found: '15'
2 Halted 0 ms 0 KB -

Subtask #5
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 89 ms 640 KB Output is correct
2 Correct 62 ms 768 KB Output is correct
3 Correct 63 ms 768 KB Output is correct
4 Correct 93 ms 768 KB Output is correct
5 Correct 93 ms 896 KB Output is correct
6 Correct 62 ms 768 KB Output is correct
7 Correct 63 ms 768 KB Output is correct
8 Correct 59 ms 768 KB Output is correct
9 Correct 93 ms 768 KB Output is correct
10 Correct 95 ms 768 KB Output is correct
11 Correct 88 ms 768 KB Output is correct
12 Correct 90 ms 768 KB Output is correct
13 Correct 83 ms 768 KB Output is correct
14 Correct 93 ms 768 KB Output is correct
15 Correct 84 ms 768 KB Output is correct
16 Correct 86 ms 768 KB Output is correct
17 Correct 88 ms 768 KB Output is correct
18 Correct 86 ms 768 KB Output is correct
19 Correct 95 ms 768 KB Output is correct
20 Correct 96 ms 768 KB Output is correct
21 Correct 94 ms 768 KB Output is correct
22 Correct 61 ms 768 KB Output is correct
23 Correct 63 ms 768 KB Output is correct
24 Correct 94 ms 768 KB Output is correct
25 Correct 91 ms 768 KB Output is correct
26 Correct 61 ms 768 KB Output is correct
27 Correct 62 ms 768 KB Output is correct
28 Correct 67 ms 768 KB Output is correct
29 Correct 92 ms 768 KB Output is correct
30 Correct 97 ms 768 KB Output is correct
31 Correct 90 ms 768 KB Output is correct
32 Correct 90 ms 768 KB Output is correct
33 Correct 83 ms 768 KB Output is correct
34 Correct 94 ms 768 KB Output is correct
35 Correct 91 ms 768 KB Output is correct
36 Correct 86 ms 768 KB Output is correct
37 Correct 87 ms 768 KB Output is correct
38 Correct 86 ms 768 KB Output is correct
39 Correct 94 ms 768 KB Output is correct
40 Correct 94 ms 768 KB Output is correct
41 Correct 82 ms 768 KB Output is correct
42 Correct 61 ms 768 KB Output is correct
43 Correct 63 ms 768 KB Output is correct
44 Correct 94 ms 768 KB Output is correct
45 Correct 90 ms 768 KB Output is correct
46 Correct 63 ms 768 KB Output is correct
47 Correct 63 ms 768 KB Output is correct
48 Correct 59 ms 768 KB Output is correct
49 Correct 92 ms 768 KB Output is correct
50 Correct 97 ms 768 KB Output is correct
51 Correct 91 ms 768 KB Output is correct
52 Correct 91 ms 896 KB Output is correct
53 Correct 84 ms 768 KB Output is correct
54 Correct 89 ms 768 KB Output is correct
55 Correct 92 ms 768 KB Output is correct
56 Correct 86 ms 768 KB Output is correct
57 Correct 87 ms 768 KB Output is correct
58 Correct 80 ms 768 KB Output is correct
59 Correct 94 ms 768 KB Output is correct
60 Correct 88 ms 768 KB Output is correct
61 Correct 90 ms 768 KB Output is correct
62 Correct 61 ms 768 KB Output is correct
63 Correct 64 ms 768 KB Output is correct
64 Correct 94 ms 768 KB Output is correct
65 Correct 91 ms 888 KB Output is correct
66 Correct 62 ms 768 KB Output is correct
67 Correct 63 ms 768 KB Output is correct
68 Correct 61 ms 768 KB Output is correct
69 Correct 94 ms 768 KB Output is correct
70 Correct 102 ms 768 KB Output is correct
71 Correct 89 ms 768 KB Output is correct
72 Correct 89 ms 768 KB Output is correct
73 Correct 83 ms 768 KB Output is correct
74 Correct 96 ms 768 KB Output is correct
75 Correct 91 ms 768 KB Output is correct
76 Correct 85 ms 768 KB Output is correct
77 Correct 86 ms 768 KB Output is correct
78 Correct 86 ms 768 KB Output is correct
79 Correct 95 ms 768 KB Output is correct
80 Correct 94 ms 768 KB Output is correct
81 Correct 89 ms 768 KB Output is correct
82 Correct 61 ms 768 KB Output is correct
83 Correct 66 ms 768 KB Output is correct
84 Correct 93 ms 768 KB Output is correct
85 Correct 91 ms 768 KB Output is correct
86 Correct 61 ms 768 KB Output is correct
87 Correct 63 ms 768 KB Output is correct
88 Correct 59 ms 768 KB Output is correct
89 Correct 91 ms 768 KB Output is correct
90 Correct 88 ms 768 KB Output is correct
91 Correct 90 ms 768 KB Output is correct
92 Correct 90 ms 768 KB Output is correct
93 Correct 83 ms 768 KB Output is correct
94 Correct 85 ms 768 KB Output is correct
95 Correct 92 ms 768 KB Output is correct
96 Correct 85 ms 768 KB Output is correct
97 Correct 87 ms 768 KB Output is correct
98 Correct 86 ms 768 KB Output is correct
99 Correct 94 ms 768 KB Output is correct

Subtask #6
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 640 KB 1st lines differ - on the 1st token, expected: '8', found: '9'
2 Halted 0 ms 0 KB -