제출 #1057020

#제출 시각아이디문제언어결과실행 시간메모리
1057020YassineBenYounesTricks of the Trade (CEOI23_trade)C++17
5 / 100
226 ms52308 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 = 1e6+5; const int LOG = 22; const int inf = 1e9; const ll mod = 1e9+7; const int sq = 300; const ld ebs = 0.000001; ll buy[mx], sell[mx], pf[mx]; ll freq[mx]; int32_t main(){ speed; int n, k;cin >> n >> k; for(int i = 0; i < n;i++){ cin >> buy[i]; pf[i] = (i == 0 ? 0 : pf[i-1]) + buy[i]; } multiset<ll> s; map<ll, vi> mp; for(int i = 0; i < n;i++){ cin >> sell[i]; if(i > 0){ s.insert(sell[i] - pf[i]); mp[sell[i] - pf[i]].pb(i); } } ll ans = -1e18; for(int i = 0; i < (n-1);i++){ ll cur = sell[i] + (i == 0 ? 0 : pf[i-1]) + *s.rbegin(); //cout << i << " " << *s.rbegin() << " " << cur << endl; ans = max(ans, cur); s.erase(s.find(sell[i+1] - pf[i+1])); } string res(n, '0'); for(int i = 1; i < n;i++){ s.insert(sell[i] - pf[i]); mp[sell[i] - pf[i]].pb(i); } for(int i = 0; i < (n-1);i++){ if(s.empty())break; ll k = *s.rbegin(); ll cur = sell[i] + (i == 0 ? 0 : pf[i-1]) + k; //cout << i << " " << *s.rbegin() << " " << cur << endl; if(cur == ans){ res[i] = '1'; for(int x : mp[k]){ res[x] = '1'; } mp[k].clear(); //s.erase(k); } ll p = sell[i+1] - pf[i+1]; if(s.count(p))s.erase(s.find(p)); } cout << ans << endl; 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...