oj.uz

답안 #1057134

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1057134 2024-08-13T14:26:51 Z YassineBenYounes Tricks of the Trade (CEOI23_trade) C++17
45 / 100
 2957 ms 812104 KB 
#include<bits/stdc++.h>
#include<chrono>
#include<random>
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef double db;
ll gcd(ll a , ll b) {return b ? gcd(b , a % b) : a ;} // greatest common divisor (PGCD)
ll lcm(ll a , ll b) {return (a * b) / gcd(a , b);} // least common multiple (PPCM)
int dx[8] = {1, 0, 0, -1, 1, 1, -1, -1};
int dy[8] = {0, 1, -1, 0, 1, -1, -1, 1};
#define endl "\n"
#define ss second
#define ff first
#define all(x) (x).begin() , (x).end()
#define pb push_back
#define vi vector<int>
#define vii vector<pair<int,int>>
#define vl vector<ll>
#define vll vector<pair<ll,ll>>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pdd  pair<double,double>
#define vdd  vector<pdd>
#define speed ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pbds tree<pii, null_type, less<pii>,rb_tree_tag, tree_order_statistics_node_update>
using namespace __gnu_pbds;
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
 
////////////////////Only Clear Code//////////////////////////
 
void usaco_problem(){
    freopen("milkvisits.in", "r", stdin);
    freopen("milkvisits.out", "w", stdout);
}
 
void init(){
    #ifndef ONLINE_JUDGE
 
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif // ONLINE_JUDGE
}
const int mx = 250003;
const int LOG = 22;
const int inf = 1e9;
const ll mod = 1e9+7;
const int sq = 300;
const ld ebs = 0.000001;
int n, k;

ll buy[mx], sell[mx];

ll dp1[mx][202], dp2[mx][202];

ll solve1(int ind, int left){
    if(ind == n)return (left == 0 ? 0 : -1e17);
    if(dp1[ind][left] != -1e18)return dp1[ind][left];
    ll a = -1e17, b = -1e17;
    if(left == k){
        a = solve1(ind+1, left-1) + sell[ind] - buy[ind];
        b = solve1(ind+1, left);
    }
    else if(left == 0){
        b = solve1(n, left);
    }
    else{
        a = solve1(ind+1, left-1) + sell[ind] - buy[ind];
        b = solve1(ind+1, left) - buy[ind];
    }
    return dp1[ind][left] = max(a, b);
}

ll solve2(int ind, int left){
    if(ind < 0)return (left == 0 ? 0 : -1e17);
    if(dp2[ind][left] != -1e18)return dp2[ind][left];
    ll a = -1e17, b = -1e17;
    if(left == k){
        a = solve2(ind-1, left-1) + sell[ind] - buy[ind];
        b = solve2(ind-1, left);
    }
    else if(left == 0){
        b = solve2(-1, left);
    }
    else{
        a = solve2(ind-1, left-1) + sell[ind] - buy[ind];
        b = solve2(ind-1, left) - buy[ind];
    }
    return dp2[ind][left] = max(a, b);
}

int32_t main(){
    speed;
    cin >> n >> k;
    for(int i = 0; i < n;i++){
        cin >> buy[i];
    }
    for(int i = 0; i < n;i++){
        cin >> sell[i];
    }
    for(int i = 0; i < n;i++){
        for(int j = 0;j <= min(n, 200);j++){
            dp1[i][j] = dp2[i][j] = -1e18;
        }
    }
    cout << solve1(0, k) << endl;
    string res(n, '0'); 
    for(int ind = 0; ind < n;ind++){
        for(int left = 0; left < k;left++){
            ll a = solve1(ind+1, left) + sell[ind] - buy[ind] + solve2(ind-1, k-left-1);
            if(a == solve1(0, k)){
                res[ind] = '1';
            }
        }
    }
    cout << res << endl;
}
 
/*
    NEVER GIVE UP!
    DOING SMTHNG IS BETTER THAN DOING NTHNG!!!
    Your Guide when stuck:
    - Continue keyword only after reading the whole input
    - Don't use memset with testcases
    - Check for corner cases(n=1, n=0)
    - Check where you declare n(Be careful of declaring it globally and in main)
*/

Compilation message

trade.cpp: In function 'void usaco_problem()':
trade.cpp:36:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   36 |     freopen("milkvisits.in", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
trade.cpp:37:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   37 |     freopen("milkvisits.out", "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
trade.cpp: In function 'void init()':
trade.cpp:43:8: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   43 | freopen("input.txt", "r", stdin);
      | ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
trade.cpp:44:8: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   44 | freopen("output.txt", "w", stdout);
      | ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #0
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 8868 KB Output is correct
5 Correct 2 ms 8796 KB Output is correct
6 Correct 1 ms 8796 KB Output is correct
7 Correct 1 ms 8796 KB Output is correct
8 Correct 1 ms 8796 KB Output is correct
9 Correct 1 ms 8796 KB Output is correct
10 Correct 1 ms 8796 KB Output is correct
11 Correct 1 ms 8660 KB Output is correct

Subtask #2
0.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 8868 KB Output is correct
5 Correct 2 ms 8796 KB Output is correct
6 Correct 1 ms 8796 KB Output is correct
7 Correct 1 ms 8796 KB Output is correct
8 Correct 1 ms 8796 KB Output is correct
9 Correct 1 ms 8796 KB Output is correct
10 Correct 1 ms 8796 KB Output is correct
11 Correct 1 ms 8660 KB Output is correct
12 Correct 1 ms 6492 KB Output is correct
13 Correct 1 ms 6492 KB Output is correct
14 Correct 1 ms 6492 KB Output is correct
15 Correct 2 ms 8796 KB Output is correct
16 Correct 2 ms 8796 KB Output is correct
17 Correct 1 ms 8796 KB Output is correct
18 Correct 1 ms 8796 KB Output is correct
19 Correct 1 ms 8796 KB Output is correct
20 Correct 1 ms 8796 KB Output is correct
21 Correct 2 ms 8792 KB Output is correct
22 Correct 1 ms 8796 KB Output is correct
23 Incorrect 307 ms 27764 KB Output isn't correct
24 Halted 0 ms 0 KB -

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 148 ms 812104 KB Output is correct
3 Correct 160 ms 811092 KB Output is correct
4 Correct 156 ms 810956 KB Output is correct
5 Correct 158 ms 810932 KB Output is correct
6 Correct 177 ms 811132 KB Output is correct
7 Correct 169 ms 811088 KB Output is correct
8 Correct 152 ms 811088 KB Output is correct
9 Correct 149 ms 811088 KB Output is correct
10 Correct 161 ms 810960 KB Output is correct

Subtask #4
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 148 ms 812104 KB Output is correct
3 Correct 160 ms 811092 KB Output is correct
4 Correct 156 ms 810956 KB Output is correct
5 Correct 158 ms 810932 KB Output is correct
6 Correct 177 ms 811132 KB Output is correct
7 Correct 169 ms 811088 KB Output is correct
8 Correct 152 ms 811088 KB Output is correct
9 Correct 149 ms 811088 KB Output is correct
10 Correct 161 ms 810960 KB Output is correct
11 Correct 1 ms 6492 KB Output is correct
12 Correct 165 ms 811000 KB Output is correct
13 Correct 170 ms 810936 KB Output is correct
14 Correct 153 ms 810904 KB Output is correct
15 Correct 163 ms 811100 KB Output is correct
16 Correct 153 ms 811348 KB Output is correct
17 Correct 151 ms 811088 KB Output is correct
18 Correct 172 ms 811088 KB Output is correct
19 Correct 159 ms 811044 KB Output is correct
20 Correct 168 ms 811092 KB Output is correct
21 Correct 1 ms 6492 KB Output is correct
22 Correct 0 ms 6492 KB Output is correct
23 Correct 1 ms 8796 KB Output is correct
24 Correct 2 ms 8796 KB Output is correct
25 Correct 1 ms 8796 KB Output is correct
26 Correct 1 ms 8796 KB Output is correct
27 Correct 1 ms 8796 KB Output is correct
28 Correct 1 ms 8792 KB Output is correct
29 Correct 1 ms 8796 KB Output is correct
30 Correct 1 ms 8796 KB Output is correct
31 Correct 2853 ms 811088 KB Output is correct
32 Correct 175 ms 810936 KB Output is correct
33 Correct 2932 ms 811092 KB Output is correct
34 Correct 2919 ms 810876 KB Output is correct
35 Correct 2865 ms 811092 KB Output is correct
36 Correct 2957 ms 811088 KB Output is correct
37 Correct 2953 ms 811088 KB Output is correct

Subtask #5
0.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 8868 KB Output is correct
7 Correct 2 ms 8796 KB Output is correct
8 Correct 1 ms 8796 KB Output is correct
9 Correct 1 ms 8796 KB Output is correct
10 Correct 1 ms 8796 KB Output is correct
11 Correct 1 ms 8796 KB Output is correct
12 Correct 1 ms 8796 KB Output is correct
13 Correct 1 ms 8660 KB Output is correct
14 Correct 1 ms 6492 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 1 ms 6492 KB Output is correct
17 Correct 2 ms 8796 KB Output is correct
18 Correct 2 ms 8796 KB Output is correct
19 Correct 1 ms 8796 KB Output is correct
20 Correct 1 ms 8796 KB Output is correct
21 Correct 1 ms 8796 KB Output is correct
22 Correct 1 ms 8796 KB Output is correct
23 Correct 2 ms 8792 KB Output is correct
24 Correct 1 ms 8796 KB Output is correct
25 Incorrect 307 ms 27764 KB Output isn't correct
26 Halted 0 ms 0 KB -