Submission #2630772

Source Code Expand

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

#define NDEBUG
#ifdef DEBUG
#include "../cout11.h"
#undef NDEBUG
#endif
#include <cassert>

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> ii;
typedef pair<ll,ll> llll;
typedef pair<double,double> dd;

typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<ll> vll;

#define sz(a)  int((a).size())
#define pb  push_back
#define FOR(var,from,to) for(int var=(from);var<=(to);++var)
#define rep(var,n)  for(int var=0;var<(n);++var)
#define rep1(var,n)  for(int var=1;var<=(n);++var)
#define repC2(vari,varj,n)  for(int vari=0;vari<(n)-1;++vari)for(int varj=vari+1;varj<(n);++varj)
#define ALL(c)  (c).begin(),(c).end()
#define RALL(c)  (c).rbegin(),(c).rend()
#define tr(i,c)  for(auto i=(c).begin(); i!=(c).end(); ++i)
#define found(s,e)  ((s).find(e)!=(s).end())
#define mset(arr,val)  memset(arr,val,sizeof(arr))
#define mid(x,y) ((x)+((y)-(x))/2)
#define IN(x,a,b) ((a)<=(x)&&(x)<=(b))

ii solve(int a,int b,int c,int d,int e,int f) {
    // 1<=a<b<=30
    // 1<=c<d<=30
    // 1<=e<=100
    // 100a <= f <= 3000
    double best = -1;
    ii best_at(-1, -1);

    vi dp_w(6001, 0), dp_s(3031, 0);
    vi ws, ss;

    dp_w[0] = dp_s[0] = 1;
    for (int i=0; i<=3000; ++i) {
        if (dp_w[i]) {
            ws.pb(i);
            dp_w[i+100*a] = dp_w[i+100*b] = 1;
        }
        if (dp_s[i]) {
            ss.pb(i);
            dp_s[i+c] = dp_s[i+d] = 1;
        }
    }
    // cerr << ws << endl;
    // cerr << ss << endl;

    for (int w:ws) {
        int solvable = w * e / 100; // わりきれる
        for (int s:ss) {
            if (s > solvable || w+s > f) break;

            double r = 100.0 * s / (w + s);
            if (r > best){
                best = r;
                best_at = ii(w+s, s);
            }
        }
    }

    return best_at;
}

int main() {
    int A,B,C,D,E,F; cin>>A>>B>>C>>D>>E>>F;
    ii ans = solve(A,B,C,D,E,F);
    cout << ans.first << " " << ans.second << endl;
    return 0;
}

Submission Info

Submission Time
Task C - Sugar Water
User naoya_t
Language C++14 (GCC 5.4.1)
Score 300
Code Size 2163 Byte
Status
Exec Time 1 ms
Memory 256 KB

Test Cases

Set Name Score / Max Score Test Cases
Sample 0 / 0 subtask0_0.txt, subtask0_1.txt, subtask0_2.txt
All 300 / 300 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, subtask0_0.txt, subtask0_1.txt, subtask0_2.txt
Case Name Status Exec Time Memory
01.txt 1 ms 256 KB
02.txt 1 ms 256 KB
03.txt 1 ms 256 KB
04.txt 1 ms 256 KB
05.txt 1 ms 256 KB
06.txt 1 ms 256 KB
07.txt 1 ms 256 KB
08.txt 1 ms 256 KB
09.txt 1 ms 256 KB
subtask0_0.txt 1 ms 256 KB
subtask0_1.txt 1 ms 256 KB
subtask0_2.txt 1 ms 256 KB