제출 #1057117

#제출 시각아이디문제언어결과실행 시간메모리
1057117YassineBenYounesTricks of the Trade (CEOI23_trade)C++17
20 / 100
2382 ms415828 KiB
#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 dp[mx][202]; ll solve(int ind, int left){ if(ind == n)return (left == 0 ? 0 : -1e17); if(dp[ind][left] != -1e18)return dp[ind][left]; ll a = -1e17, b = -1e17; if(left == k){ a = solve(ind+1, left-1) + sell[ind] - buy[ind]; b = solve(ind+1, left); } else if(left == 0){ b = solve(n, left); } else{ a = solve(ind+1, left-1) + sell[ind] - buy[ind]; b = solve(ind+1, left) - buy[ind]; } return dp[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++){ dp[i][j] = -1e18; } } cout << solve(0, k) << endl; string res(n, '0'); for(int ind = 0; ind < n;ind++){ for(int left = 1; left <= k;left++){ ll a = solve(ind+1, left-1) + sell[ind] - buy[ind]; if(a == solve(ind, left)){ 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) */

컴파일 시 표준 에러 (stderr) 메시지

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);
      | ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...