Submission #1173212
Source Code Expand
#include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <cstring>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <algorithm>
using namespace std;
#define REP(i,n) for(int i=0; i<n; ++i)
#define FOR(i,a,b) for(int i=a; i<=b; ++i)
#define FORR(i,a,b) for (int i=a; i>=b; --i)
#define ALL(c) (c).begin(), (c).end()
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<VI> VVI;
typedef pair<int,int> P;
typedef pair<ll,ll> PL;
ofstream ofs("outa.txt");
const int n = 8;
int c[n], a[n], d, t;
int dp[n][51];
void input(){
cin >> d >> t;
REP(i,n) scanf("%d", &c[i]);
REP(i,n) scanf("%d", &a[i]);
}
void sell(VI x){
printf("sell %d ", (int)x.size());
REP(i,x.size()) cout << x[i]+1 << " ";
cout << endl;
}
void fill(int i){
cout << "fill " << i+1 << endl;
}
void pass(){
cout << "pass" << endl;
}
VI exist(){
REP(i,1<<n){
int s = 0;
REP(j,n){
if ((i>>j) & 1) s += a[j];
}
if (s == d){
VI ret;
REP(j,n) if ((i>>j) & 1) ret.push_back(j);
return ret;
}
}
return VI(1,-1);
}
void act(){
input();
VI x = exist();
if (x[0] != -1){
sell(x);
return;
}
REP(i,n){
if (a[i] == 0){
fill(i);
return;
}
}
pass();
}
int main() {
int q = 1000;
while (q--){
act();
}
return 0;
}
Submission Info
Submission Time |
|
Task |
A - 石油王Xの憂鬱 |
User |
TangentDay |
Language |
C++14 (GCC 5.4.1) |
Score |
5526274 |
Code Size |
1614 Byte |
Status |
AC |
Exec Time |
52 ms |
Memory |
1224 KB |
Compile Error
./Main.cpp: In function ‘void input()’:
./Main.cpp:34:32: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
REP(i,n) scanf("%d", &c[i]);
^
./Main.cpp:35:32: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
REP(i,n) scanf("%d", &a[i]);
^
Judge Result
Set Name |
test_01 |
test_02 |
test_03 |
test_04 |
test_05 |
test_06 |
test_07 |
test_08 |
test_09 |
test_10 |
test_11 |
test_12 |
test_13 |
test_14 |
test_15 |
test_16 |
test_17 |
test_18 |
test_19 |
test_20 |
test_21 |
test_22 |
test_23 |
test_24 |
test_25 |
test_26 |
test_27 |
test_28 |
test_29 |
test_30 |
test_31 |
test_32 |
test_33 |
test_34 |
test_35 |
test_36 |
test_37 |
test_38 |
test_39 |
test_40 |
test_41 |
test_42 |
test_43 |
test_44 |
test_45 |
test_46 |
test_47 |
test_48 |
test_49 |
test_50 |
Score / Max Score |
117079 / 417500 |
108751 / 417500 |
106522 / 417500 |
106585 / 417500 |
113475 / 417500 |
115467 / 417500 |
127257 / 417500 |
115337 / 417500 |
117680 / 417500 |
120646 / 417500 |
116991 / 417500 |
114634 / 417500 |
115706 / 417500 |
108169 / 417500 |
105423 / 417500 |
113310 / 417500 |
112034 / 417500 |
105053 / 417500 |
117503 / 417500 |
103578 / 417500 |
109890 / 417500 |
109497 / 417500 |
102748 / 417500 |
101253 / 417500 |
106416 / 417500 |
109048 / 417500 |
116461 / 417500 |
114606 / 417500 |
109210 / 417500 |
113194 / 417500 |
106711 / 417500 |
105062 / 417500 |
108431 / 417500 |
103906 / 417500 |
104592 / 417500 |
113548 / 417500 |
114467 / 417500 |
103899 / 417500 |
106658 / 417500 |
107510 / 417500 |
110911 / 417500 |
114557 / 417500 |
115619 / 417500 |
108720 / 417500 |
103906 / 417500 |
104973 / 417500 |
108792 / 417500 |
110570 / 417500 |
107638 / 417500 |
112281 / 417500 |
Status |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Set Name |
Test Cases |
test_01 |
subtask_01_01.txt |
test_02 |
subtask_01_02.txt |
test_03 |
subtask_01_03.txt |
test_04 |
subtask_01_04.txt |
test_05 |
subtask_01_05.txt |
test_06 |
subtask_01_06.txt |
test_07 |
subtask_01_07.txt |
test_08 |
subtask_01_08.txt |
test_09 |
subtask_01_09.txt |
test_10 |
subtask_01_10.txt |
test_11 |
subtask_01_11.txt |
test_12 |
subtask_01_12.txt |
test_13 |
subtask_01_13.txt |
test_14 |
subtask_01_14.txt |
test_15 |
subtask_01_15.txt |
test_16 |
subtask_01_16.txt |
test_17 |
subtask_01_17.txt |
test_18 |
subtask_01_18.txt |
test_19 |
subtask_01_19.txt |
test_20 |
subtask_01_20.txt |
test_21 |
subtask_01_21.txt |
test_22 |
subtask_01_22.txt |
test_23 |
subtask_01_23.txt |
test_24 |
subtask_01_24.txt |
test_25 |
subtask_01_25.txt |
test_26 |
subtask_01_26.txt |
test_27 |
subtask_01_27.txt |
test_28 |
subtask_01_28.txt |
test_29 |
subtask_01_29.txt |
test_30 |
subtask_01_30.txt |
test_31 |
subtask_01_31.txt |
test_32 |
subtask_01_32.txt |
test_33 |
subtask_01_33.txt |
test_34 |
subtask_01_34.txt |
test_35 |
subtask_01_35.txt |
test_36 |
subtask_01_36.txt |
test_37 |
subtask_01_37.txt |
test_38 |
subtask_01_38.txt |
test_39 |
subtask_01_39.txt |
test_40 |
subtask_01_40.txt |
test_41 |
subtask_01_41.txt |
test_42 |
subtask_01_42.txt |
test_43 |
subtask_01_43.txt |
test_44 |
subtask_01_44.txt |
test_45 |
subtask_01_45.txt |
test_46 |
subtask_01_46.txt |
test_47 |
subtask_01_47.txt |
test_48 |
subtask_01_48.txt |
test_49 |
subtask_01_49.txt |
test_50 |
subtask_01_50.txt |
Case Name |
Status |
Exec Time |
Memory |
subtask_01_01.txt |
AC |
52 ms |
1224 KB |
subtask_01_02.txt |
AC |
47 ms |
724 KB |
subtask_01_03.txt |
AC |
49 ms |
672 KB |
subtask_01_04.txt |
AC |
45 ms |
716 KB |
subtask_01_05.txt |
AC |
43 ms |
720 KB |
subtask_01_06.txt |
AC |
44 ms |
716 KB |
subtask_01_07.txt |
AC |
46 ms |
592 KB |
subtask_01_08.txt |
AC |
47 ms |
648 KB |
subtask_01_09.txt |
AC |
44 ms |
724 KB |
subtask_01_10.txt |
AC |
45 ms |
596 KB |
subtask_01_11.txt |
AC |
46 ms |
720 KB |
subtask_01_12.txt |
AC |
44 ms |
720 KB |
subtask_01_13.txt |
AC |
43 ms |
720 KB |
subtask_01_14.txt |
AC |
44 ms |
720 KB |
subtask_01_15.txt |
AC |
45 ms |
720 KB |
subtask_01_16.txt |
AC |
47 ms |
724 KB |
subtask_01_17.txt |
AC |
45 ms |
716 KB |
subtask_01_18.txt |
AC |
45 ms |
724 KB |
subtask_01_19.txt |
AC |
45 ms |
648 KB |
subtask_01_20.txt |
AC |
46 ms |
716 KB |
subtask_01_21.txt |
AC |
43 ms |
716 KB |
subtask_01_22.txt |
AC |
45 ms |
656 KB |
subtask_01_23.txt |
AC |
49 ms |
720 KB |
subtask_01_24.txt |
AC |
48 ms |
724 KB |
subtask_01_25.txt |
AC |
46 ms |
596 KB |
subtask_01_26.txt |
AC |
46 ms |
720 KB |
subtask_01_27.txt |
AC |
46 ms |
724 KB |
subtask_01_28.txt |
AC |
46 ms |
716 KB |
subtask_01_29.txt |
AC |
45 ms |
596 KB |
subtask_01_30.txt |
AC |
45 ms |
676 KB |
subtask_01_31.txt |
AC |
47 ms |
720 KB |
subtask_01_32.txt |
AC |
46 ms |
720 KB |
subtask_01_33.txt |
AC |
46 ms |
720 KB |
subtask_01_34.txt |
AC |
44 ms |
720 KB |
subtask_01_35.txt |
AC |
46 ms |
716 KB |
subtask_01_36.txt |
AC |
45 ms |
720 KB |
subtask_01_37.txt |
AC |
45 ms |
652 KB |
subtask_01_38.txt |
AC |
45 ms |
724 KB |
subtask_01_39.txt |
AC |
46 ms |
720 KB |
subtask_01_40.txt |
AC |
46 ms |
716 KB |
subtask_01_41.txt |
AC |
46 ms |
724 KB |
subtask_01_42.txt |
AC |
48 ms |
616 KB |
subtask_01_43.txt |
AC |
44 ms |
716 KB |
subtask_01_44.txt |
AC |
43 ms |
724 KB |
subtask_01_45.txt |
AC |
45 ms |
604 KB |
subtask_01_46.txt |
AC |
45 ms |
720 KB |
subtask_01_47.txt |
AC |
45 ms |
716 KB |
subtask_01_48.txt |
AC |
47 ms |
692 KB |
subtask_01_49.txt |
AC |
43 ms |
688 KB |
subtask_01_50.txt |
AC |
46 ms |
720 KB |