oj.uz

답안 #50148

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
50148 2018-06-07T21:38:37 Z spencercompton Candies (JOI18_candies) C++17
100 / 100
 1054 ms 13328 KB 
#include<bits/stdc++.h>
using namespace std;
long long ar[200000];
int n;
vector<long long> mg(vector<long long> a, vector<long long> b){
    int p1 = 0;
    int p2 = 0;
    vector<long long> ret;
    ret.push_back(0LL);
    while(p1+1<a.size() || p2+1<b.size()){
        bool add1 = false;
        if(p1+1==a.size()){
            //add2
        }
        else if(p2+1==b.size()){
            //add1
            add1 = true;
        }
        else{
            if(a[p1+1]-a[p1]>=b[p2+1]-b[p2]){
                add1 = true;
            }
        }
        if(add1){
            p1++;
        }
        else{
            p2++;
        }
        ret.push_back(a[p1]+b[p2]);
    }
    return ret;
}
vector<long long> comb(vector<long long> a, vector<long long> b){
    if(a.size()>b.size()){
        swap(a,b);
    }
    vector<long long> ret;
    for(int i = 0; i<a.size(); i++){
        ret.push_back(max(a[i],b[i]));
    }
    for(int i = a.size(); i<b.size(); i++){
        ret.push_back(b[i]);
    }
    return ret;
}
vector<vector<long long> > go(int l, int r){
    if(l==r){
        vector<long long> ret1;
        vector<vector<long long> > ret;
        ret1.push_back(0LL);
        ret1.push_back(ar[l]);
        ret.push_back(ret1);
        ret1.resize(1);
        for(int i = 0; i<3; i++){
            ret.push_back(ret1);
        }
        return ret;
    }
    int mid = (l+r)/2;
    vector<vector<long long> > a = go(l,mid);
    vector<vector<long long> > b = go(mid+1,r);
    vector<vector<long long> > ret;
    //0
    ret.push_back(comb(mg(a[1],b[0]),mg(a[0],b[2])));
    //1 01
    ret.push_back(comb(mg(a[1],b[1]),mg(a[0],b[3])));
    //2 10
    ret.push_back(comb(mg(a[3],b[0]),mg(a[2],b[2])));
    //3 11
    ret.push_back(comb(mg(a[3],b[1]),mg(a[2],b[3])));
    
    return ret;
    // if(!cl){
    //     l++;
    // }
    // if(!cr){
    //     r--;
    // }
    // vector<long long> ret;
    // ret.push_back(0);
    // if(l>r){
    //     return ret;
    // }
    // if(l==r){
    //     ret.push_back(ar[l]);
    //     return ret;
    // }
    // int mid = (l+r)/2;
    // //use mid
    // ret.push_back(ar[mid]);
    
    // ret = mg(mg(ret,go(true,false,l,mid-1)),go(false,true,mid+1,r));
    // //don't use mid
    // ret = comb(ret,mg(go(true,true,l,mid-1),go(true,true,mid+1,r)));
    // return ret;
}
int main() {
    std::ios::sync_with_stdio(false);
    cin.tie(0);
    cin >> n;
    for(int i = 0; i<n; i++){
        cin >> ar[i];
    }
    vector<vector<long long> > ans = go(0,n-1);
    for(int i = 1; i<=(n+1)/2; i++){
        cout << ans[0][i] << "\n";
    }
    return 0;
}

Compilation message

candies.cpp: In function 'std::vector<long long int> mg(std::vector<long long int>, std::vector<long long int>)':
candies.cpp:10:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     while(p1+1<a.size() || p2+1<b.size()){
           ~~~~^~~~~~~~~
candies.cpp:10:32: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     while(p1+1<a.size() || p2+1<b.size()){
                            ~~~~^~~~~~~~~
candies.cpp:12:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if(p1+1==a.size()){
            ~~~~^~~~~~~~~~
candies.cpp:15:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         else if(p2+1==b.size()){
                 ~~~~^~~~~~~~~~
candies.cpp: In function 'std::vector<long long int> comb(std::vector<long long int>, std::vector<long long int>)':
candies.cpp:39:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0; i<a.size(); i++){
                    ~^~~~~~~~~
candies.cpp:42:28: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = a.size(); i<b.size(); i++){
                           ~^~~~~~~~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 504 KB Output is correct
2 Correct 13 ms 504 KB Output is correct
3 Correct 9 ms 584 KB Output is correct
4 Correct 9 ms 676 KB Output is correct
5 Correct 9 ms 692 KB Output is correct
6 Correct 14 ms 708 KB Output is correct
7 Correct 9 ms 836 KB Output is correct
8 Correct 11 ms 836 KB Output is correct
9 Correct 10 ms 836 KB Output is correct
10 Correct 9 ms 836 KB Output is correct
11 Correct 9 ms 836 KB Output is correct
12 Correct 11 ms 836 KB Output is correct
13 Correct 9 ms 860 KB Output is correct
14 Correct 11 ms 860 KB Output is correct
15 Correct 16 ms 860 KB Output is correct
16 Correct 9 ms 908 KB Output is correct
17 Correct 9 ms 908 KB Output is correct
18 Correct 9 ms 908 KB Output is correct
19 Correct 10 ms 908 KB Output is correct
20 Correct 9 ms 908 KB Output is correct

Subtask #2
92.0 / 92.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 504 KB Output is correct
2 Correct 13 ms 504 KB Output is correct
3 Correct 9 ms 584 KB Output is correct
4 Correct 9 ms 676 KB Output is correct
5 Correct 9 ms 692 KB Output is correct
6 Correct 14 ms 708 KB Output is correct
7 Correct 9 ms 836 KB Output is correct
8 Correct 11 ms 836 KB Output is correct
9 Correct 10 ms 836 KB Output is correct
10 Correct 9 ms 836 KB Output is correct
11 Correct 9 ms 836 KB Output is correct
12 Correct 11 ms 836 KB Output is correct
13 Correct 9 ms 860 KB Output is correct
14 Correct 11 ms 860 KB Output is correct
15 Correct 16 ms 860 KB Output is correct
16 Correct 9 ms 908 KB Output is correct
17 Correct 9 ms 908 KB Output is correct
18 Correct 9 ms 908 KB Output is correct
19 Correct 10 ms 908 KB Output is correct
20 Correct 9 ms 908 KB Output is correct
21 Correct 867 ms 13320 KB Output is correct
22 Correct 859 ms 13320 KB Output is correct
23 Correct 884 ms 13320 KB Output is correct
24 Correct 852 ms 13320 KB Output is correct
25 Correct 798 ms 13320 KB Output is correct
26 Correct 800 ms 13320 KB Output is correct
27 Correct 817 ms 13328 KB Output is correct
28 Correct 892 ms 13328 KB Output is correct
29 Correct 829 ms 13328 KB Output is correct
30 Correct 934 ms 13328 KB Output is correct
31 Correct 1002 ms 13328 KB Output is correct
32 Correct 1054 ms 13328 KB Output is correct
33 Correct 955 ms 13328 KB Output is correct
34 Correct 897 ms 13328 KB Output is correct
35 Correct 906 ms 13328 KB Output is correct
36 Correct 950 ms 13328 KB Output is correct
37 Correct 864 ms 13328 KB Output is correct
38 Correct 986 ms 13328 KB Output is correct
39 Correct 803 ms 13328 KB Output is correct
40 Correct 866 ms 13328 KB Output is correct
41 Correct 909 ms 13328 KB Output is correct
42 Correct 874 ms 13328 KB Output is correct
43 Correct 862 ms 13328 KB Output is correct
44 Correct 810 ms 13328 KB Output is correct
45 Correct 830 ms 13328 KB Output is correct
46 Correct 924 ms 13328 KB Output is correct
47 Correct 905 ms 13328 KB Output is correct
48 Correct 950 ms 13328 KB Output is correct
49 Correct 806 ms 13328 KB Output is correct
50 Correct 840 ms 13328 KB Output is correct