結果
| 問題 |
No.198 キャンディー・ボックス2
|
| コンテスト | |
| ユーザー |
turane_gaku
|
| 提出日時 | 2015-05-15 04:34:47 |
| 言語 | C++11(廃止可能性あり) (gcc 13.3.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 1,580 bytes |
| コンパイル時間 | 784 ms |
| コンパイル使用メモリ | 89,120 KB |
| 実行使用メモリ | 6,948 KB |
| 最終ジャッジ日時 | 2024-07-06 03:53:45 |
| 合計ジャッジ時間 | 1,752 ms |
|
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
| ファイルパターン | 結果 |
|---|---|
| sample | WA * 4 |
| other | WA * 26 |
コンパイルメッセージ
main.cpp: In function ‘int main()’:
main.cpp:66:13: warning: format ‘%d’ expects argument of type ‘int’, but argument 2 has type ‘ll’ {aka ‘long long int’} [-Wformat=]
66 | LOG("%d %d %d\n", able, cnt, trg);
| ^~~~~~~~~~~~ ~~~~
| |
| ll {aka long long int}
main.cpp:21:25: note: in definition of macro ‘LOG’
21 | #define LOG(...) printf(__VA_ARGS__)
| ^~~~~~~~~~~
main.cpp:66:15: note: format string is defined here
66 | LOG("%d %d %d\n", able, cnt, trg);
| ~^
| |
| int
| %lld
main.cpp:66:13: warning: format ‘%d’ expects argument of type ‘int’, but argument 3 has type ‘ll’ {aka ‘long long int’} [-Wformat=]
66 | LOG("%d %d %d\n", able, cnt, trg);
| ^~~~~~~~~~~~ ~~~
| |
| ll {aka long long int}
main.cpp:21:25: note: in definition of macro ‘LOG’
21 | #define LOG(...) printf(__VA_ARGS__)
| ^~~~~~~~~~~
main.cpp:66:18: note: format string is defined here
66 | LOG("%d %d %d\n", able, cnt, trg);
| ~^
| |
| int
| %lld
main.cpp:66:13: warning: format ‘%d’ expects argument of type ‘int’, but argument 4 has type ‘ll’ {aka ‘long long int’} [-Wformat=]
66 | LOG("%d %d %d\n", able, cnt, trg);
| ^~~~~~~~~~~~ ~~~
| |
| ll {aka long long int}
main.cpp:21:25: note: in definition of macro ‘LOG’
21 | #define LOG(...) printf(__VA_ARGS__)
| ^~~~~~~~~~~
main.cpp:66:21: note: format string is defined here
66 |
ソースコード
#include <algorithm>
#include <cmath>
#include <climits>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <cassert>
using namespace std;
#define LOG(...) printf(__VA_ARGS__)
//#define LOG(...)
#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define REP(i,n) for(int i=0;i<(int)(n);++i)
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
#define RSORT(c) sort((c).rbegin(),(c).rend())
#define CLR(a) memset((a), 0 ,sizeof(a))
typedef long long ll;
typedef unsigned long long ull;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vb> vvb;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int dx[] = {-1,0,1,0}; const int dy[] = {0,1,0,-1};
int main() {
ll have, box_n;
cin >> have >> box_n;
vll boxes(box_n);
REP(i, box_n){
cin >> boxes[i];
}
SORT(boxes);
ll trg = boxes[boxes.size()/2];
ll able = -1, cnt = 0;
while(able < 0) {
able = have;
cnt = 0;
for (auto n:boxes) {
ll d = n - trg;
able += d;
cnt += abs(d);
}
LOG("%d %d %d\n", able, cnt, trg);
ll dd = able/box_n;
trg+= dd == 0 ? -1 : dd;
}
cout << cnt << endl;
}
turane_gaku