제출 #652791

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
652791		coding_snorlax	비스킷 담기 (IOI20_biscuits)	C++14	42 / 100	1090 ms	12728 KiB

biscuits

#include "biscuits.h"
#include<bits/stdc++.h>
using namespace std;
long long int count_tastiness(long long int x,vector<long long int> a){
    int Total=a.size();
    for(int i=Total;i<60;i++){
        a.push_back(0);
    }
    vector<pair<long long int,long long int>> answer={make_pair(0,1)};
    long long int Count=0;
    for(int i=0;i<60;i++){
        vector<pair<long long int,long long int>> tmp;
        for(int j=0;j<(int)answer.size();j++){
            if(answer[j].first-x+a[i]>=0){
                tmp.push_back(make_pair((answer[j].first-x+a[i])/2,answer[j].second));
            }
            tmp.push_back(make_pair((answer[j].first+a[i])/2,answer[j].second));
        }
        sort(tmp.begin(),tmp.end());
        answer.clear();
        long long int tmp_num=0;
        long long int now=tmp[0].first;
        tmp.push_back(make_pair(-1,0));
        for(int j=0;j<(int)tmp.size();j++){
            if(tmp[j].first!=now){
                answer.push_back(make_pair(tmp[j-1].first,tmp_num));
                tmp_num=tmp[j].second;
                now=tmp[j].first;
            }
            else tmp_num+=tmp[j].second;
        }
    }
    for(int j=0;j<(int)answer.size();j++){
        Count+=answer[j].second;
    }
    return Count;

}

• Subtask 1: 9 / 9
• Subtask 2: 12 / 12
• Subtask 3: 21 / 21
• Subtask 4: 0 / 35
• Subtask 5: 0 / 23