#965493 (C++17(gcc12)) No.2700 Please Hack Greedy Solution!

• 問題: No.2700 Please Hack Greedy Solution!
• ユーザー: 👑 Nachia
• 提出日時: 2024-03-29 21:23:27
• 言語: C++17(gcc12) (gcc 12.3.0 + boost 1.87.0)
• 結果: WA
• 実行時間: -
• コード長: 2,061 bytes
• コンパイル時間: 2,432 ms
• コンパイル使用メモリ: 126,696 KB
• 実行使用メモリ: 6,820 KB
• 最終ジャッジ日時: 2025-01-06 11:34:36
• 合計ジャッジ時間: 2,982 ms
• ジャッジサーバーID （参考情報）: judge5 / judge2

ファイルパターン	結果
other	WA * 1

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
#ifdef NACHIA
#define _GLIBCXX_DEBUG
#else
#define NDEBUG
#endif
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <queue>
#include <array>
#include <cmath>
#include <atcoder/modint>
using i64 = long long;
using u64 = unsigned long long;
#define rep(i,n) for(int i=0; i<int(n); i++)
#define repr(i,n) for(int i=int(n)-1; i>=0; i--)
const i64 INF = 1001001001001001001;
const char* yn(bool x){ return x ? "Yes" : "No"; }
template<typename A> void chmin(A& l, const A& r){ if(r < l) l = r; }
template<typename A> void chmax(A& l, const A& r){ if(l < r) l = r; }
template<typename A> using nega_queue = std::priority_queue<A,std::vector<A>,std::greater<A>>;
using Modint = atcoder::static_modint<998244353>;
//#include "nachia/vec.hpp"
using namespace std;
void testcase(){
    int N = 1002;
    int X = 1000;
    vector<int> W, V;
    W.push_back(1); V.push_back(100000);
    W.push_back(1); V.push_back(100000);
    for(int w=1; w<=1000; w++){
        W.push_back(w);
        V.push_back(w * 99999 + 40000);
    }
    //vector<i64> D(X+1);
    //rep(i,N) for(i64 w=W[i]; w<=X; w++) chmax(D[w], D[w-W[i]] + V[i]);
    //vector<pair<i64,i64>> que(N);
    //rep(i,N) que[i] = {W[i], V[i]};
    //sort(que.begin(), que.end(), [&](auto a, auto b){
    //    return make_pair(a.first*b.second, a.first) < make_pair(b.first*a.second, b.first); });
    //vector<i64> E(X+1);
    //for(i64 w=1; w<=X; w++){
    //    i64 t = 0, ww = w;
    //    for(auto [u,v] : que) if(ww >= u){ ww -= u; t += v; }
    //    E[w] = t;
    //}
    //rep(i,X+1) cout << D[i] << " ";
    //cout << endl;
    //rep(i,X+1) cout << E[i] << " ";
    //cout << endl;
    //i64 scnt = 0;
    //rep(i,X+1) if(i && D[i] == E[i]) scnt++;
    //cout << scnt << endl;
    cout << N << " " << X << "\n";
    rep(i,N) cout << V[i] << " " << W[i] << "\n";
}
int main(){
    ios::sync_with_stdio(false); cin.tie(nullptr);
    #ifdef NACHIA
    int T; cin >> T; for(int t=0; t<T; T!=++t?(cout<<'\n'),0:0)
    #endif
    testcase();
    return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX