Submission #1520270


Source Code Expand

#include<bits/stdc++.h>

using namespace std;
using ll = long long;
using ld = long double;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define reps(i,s,n) for(int i=(int)(s);i<(int)(n);i++)
const ll INF = 1e10;
int main() {
	cin.sync_with_stdio(false);
	ll N, W;
	cin >> N >> W;
	ll w[100], v[100];
	vector<vector<ll>>wv(4);
	rep(i, N)cin >> w[i] >> v[i];
	rep(i, N)wv[w[i] - w[0]].push_back(v[i]);
	rep(i, 4)sort(wv[i].begin(),wv[i].end(), greater<ll>());

	ll vi[4] = {};
	ll wi[4] = {};
	priority_queue<ll>ans;
	reps(i,-1,wv[0].size()) {
		if (i != -1) {
			wi[0] += w[0];
			if (wi[0] > W)break;
			vi[0] += wv[0][i];
		}
		vi[1] = 0; wi[1] = 0;
		reps(j, -1, wv[1].size()) {
			if (j != -1) {
				wi[1] += w[1];
				if (wi[0] + wi[1] > W) { ans.push(vi[0]); break; }
				vi[1] += wv[1][j];
			}
			vi[2] = 0; wi[2] = 0;
			reps(k, -1, wv[2].size()) {
				if (k != -1) {
					wi[2] += w[2];
					if (wi[0] + wi[1] + wi[2] > W) { ans.push(vi[0] + vi[1]); break; }
					vi[2] += wv[2][k];
				}
				vi[3] = 0; wi[3] = 0;
				reps(l, -1, wv[3].size()) {
					if (l != -1) {
						wi[3] += w[3];
						if (wi[0] + wi[1] + wi[2] + wi[3] > W) {
							ans.push(vi[0] + vi[1] + vi[2]);
							break;
						}
						vi[3] += wv[3][l];
					}
					ans.push(vi[0] + vi[1] + vi[2] + vi[3]);
				}
			}
		}
	}
	cout << ans.top() << endl;
	return 0;
}

Submission Info

Submission Time
Task D - Score Attack
User agis
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1401 Byte
Status RE
Exec Time 103 ms
Memory 256 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 400
Status
WA × 2
RE × 1
WA × 2
RE × 28
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
All sample_01.txt, sample_02.txt, sample_03.txt, subtask_1_1.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt, subtask_1_16.txt, subtask_1_17.txt, subtask_1_18.txt, subtask_1_19.txt, subtask_1_2.txt, subtask_1_20.txt, subtask_1_21.txt, subtask_1_22.txt, subtask_1_23.txt, subtask_1_24.txt, subtask_1_25.txt, subtask_1_26.txt, subtask_1_27.txt, subtask_1_3.txt, subtask_1_4.txt, subtask_1_5.txt, subtask_1_6.txt, subtask_1_7.txt, subtask_1_8.txt, subtask_1_9.txt
Case Name Status Exec Time Memory
sample_01.txt WA 1 ms 256 KB
sample_02.txt WA 1 ms 256 KB
sample_03.txt RE 96 ms 256 KB
subtask_1_1.txt RE 95 ms 256 KB
subtask_1_10.txt RE 95 ms 256 KB
subtask_1_11.txt RE 95 ms 256 KB
subtask_1_12.txt RE 96 ms 256 KB
subtask_1_13.txt RE 95 ms 256 KB
subtask_1_14.txt RE 96 ms 256 KB
subtask_1_15.txt RE 96 ms 256 KB
subtask_1_16.txt RE 95 ms 256 KB
subtask_1_17.txt RE 95 ms 256 KB
subtask_1_18.txt RE 96 ms 256 KB
subtask_1_19.txt RE 98 ms 256 KB
subtask_1_2.txt RE 96 ms 256 KB
subtask_1_20.txt RE 96 ms 256 KB
subtask_1_21.txt RE 95 ms 256 KB
subtask_1_22.txt RE 96 ms 256 KB
subtask_1_23.txt RE 95 ms 256 KB
subtask_1_24.txt RE 95 ms 256 KB
subtask_1_25.txt RE 95 ms 256 KB
subtask_1_26.txt RE 96 ms 256 KB
subtask_1_27.txt RE 103 ms 256 KB
subtask_1_3.txt RE 96 ms 256 KB
subtask_1_4.txt RE 95 ms 256 KB
subtask_1_5.txt RE 95 ms 256 KB
subtask_1_6.txt RE 96 ms 256 KB
subtask_1_7.txt RE 95 ms 256 KB
subtask_1_8.txt RE 96 ms 256 KB
subtask_1_9.txt RE 95 ms 256 KB