제출 #1056989

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1056989		YassineBenYounes	Tricks of the Trade (CEOI23_trade)	C++17	0 / 100	2 ms	348 KiB

trade

#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];
ll freq[mx];
int32_t main(){
    init();
    speed;
    int n, k;cin >> n >> k;
    for(int i = 0; i < n;i++){
        cin >> buy[i];
    }
    for(int i = 0; i < n;i++){
        cin >> sell[i];
    }
    ll ans = -1e18;
    for(int i = 0; i < n;i++){
        priority_queue<pll, vll, greater<pll>> pq;
        ll profit = 0;
        for(int j = i;j < n;j++){
            profit -= buy[j];
            if(pq.size() < k){
                pq.push({sell[j], j});
                profit += sell[j];
            }
            else{
                if(sell[j] >= pq.top().ff){
                    profit -= pq.top().ff;
                    profit += sell[j];
                    pq.pop();
                    pq.push({sell[j], j});
                }
            }
            if(pq.size() == k){
                ans = max(ans, profit);
            }
        }
    }
    string st;
    set<int> pos;
    for(int i = 0; i < n;i++){
        priority_queue<pll, vll, greater<pll>> pq;
        ll profit = 0;
        set<int> v;
        for(int j = i;j < n;j++){
            profit -= buy[j];
            if(pq.size() < k){
                pq.push({sell[j], j});
                profit += sell[j];
                v.insert(j);
                if(pq.size() == k){
                    if(profit == ans){
                        /*cout << i << " " << j << "::" << endl;
                        for(int x : v){
                            cout << x << " ";
                        }
                        cout << endl;*/
                        //if(v.size() > pos.size())swap(v, pos);
                        for(int x : v){
                            pos.insert(x);
                        }
                    }
                }
            }
            else{
                if(sell[j] == pq.top().ff){
                    v.insert(j);
                    pq.push({sell[j], j});
                }
                else if(sell[j] > pq.top().ff){
                    v.erase(pq.top().ss);
                    v.insert(j);
                    profit -= pq.top().ff;
                    profit += sell[j];
                    pq.pop();
                    pq.push({sell[j], j});
                }
                if(profit == ans){
                    /*cout << i << " " << j << "::" << endl;
                    for(int x : v){
                        cout << x << " ";
                    }
                    cout << endl;*/
                    //if(v.size() > pos.size())swap(v, pos);
                    for(int x : v){
                        pos.insert(x);
                    }
                }
            }
        }
    }
    string best(n, '0');
    for(int x : pos){
        best[x] = '1';
    }
    cout << ans << endl;
    cout << best << 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 'int32_t main()':
trade.cpp:72:26: warning: comparison of integer expressions of different signedness: 'std::priority_queue<std::pair<long long int, long long int>, std::vector<std::pair<long long int, long long int> >, std::greater<std::pair<long long int, long long int> > >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   72 |             if(pq.size() < k){
      |                ~~~~~~~~~~^~~
trade.cpp:84:26: warning: comparison of integer expressions of different signedness: 'std::priority_queue<std::pair<long long int, long long int>, std::vector<std::pair<long long int, long long int> >, std::greater<std::pair<long long int, long long int> > >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   84 |             if(pq.size() == k){
      |                ~~~~~~~~~~^~~~
trade.cpp:97:26: warning: comparison of integer expressions of different signedness: 'std::priority_queue<std::pair<long long int, long long int>, std::vector<std::pair<long long int, long long int> >, std::greater<std::pair<long long int, long long int> > >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   97 |             if(pq.size() < k){
      |                ~~~~~~~~~~^~~
trade.cpp:101:30: warning: comparison of integer expressions of different signedness: 'std::priority_queue<std::pair<long long int, long long int>, std::vector<std::pair<long long int, long long int> >, std::greater<std::pair<long long int, long long int> > >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  101 |                 if(pq.size() == k){
      |                    ~~~~~~~~~~^~~~
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
• Subtask 1: 0 / 10
• Subtask 2: 0 / 10
• Subtask 3: 0 / 10
• Subtask 4: 0 / 25
• Subtask 5: 0 / 45