Submission #532086

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
532086	2022-03-02 05:24:00	fhvirus	Naan (JOI19_naan)	C++17	24 / 100	3749 ms	492 KiB

naan

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
    // Knapsack DP is harder than FFT.
    #include <bits/stdc++.h>
    using namespace std;
    typedef int64_t ll; typedef pair<int, int> pii;
    #define pb emplace_back
    #define AI(x) begin(x),end(x)
    #define ff first
    #define ss second
    #ifdef OWO
    #define debug(args...) LKJ("\033[1;32m[ " + string(#args) + " ]\033[0m", args)
    template <class I> void LKJ(I&&x) { cerr << x << endl; }
    template <class I, class...T> void LKJ(I&&x, T&&...t) { cerr << x << ", "; LKJ(t...); }
    template <class I> void OI(I a, I b) { while (a != b) cerr << *a << " \n"[(a = next(a)) == b]; }
    #else
    #define debug(...) 0
    #define OI(...) 0
    #endif
     
    const int kN = 2002;
    int N, L, V[kN][kN];
    ll dupl, pre[kN][kN], ori[kN];
     
    ll f(int i, ll j) {
      int k = j / dupl;
      return pre[i][k] * dupl + V[i][k + 1] * (j - k * dupl);
    }
     
    bool solve(const vector<int>& perm) {
      vector<ll> x(1, 0);
      for (const int& i: perm) {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 0 / 5
• Subtask 2: 24 / 24
• Subtask 3: 0 / 71