Submission #1046318

#	Time	Username	Problem	Language	Result	Execution time	Memory
1046318		YassineBenYounes	Gift Exchange (JOI24_ho_t4)	C++17	50 / 100	2597 ms	10172 KiB

Main

#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 = 5e5+5;
const int LOG = 22;
const int inf = 1e9;
const ll mod = 1e9+7;
const int sq = 300;

int a[mx], b[mx];

int32_t main(){
    speed;
    int n;cin >> n;
    for(int i = 0; i < n;i++){
        cin >> a[i];
    }
    for(int j = 0;j < n;j++) {
        cin >> b[j];
    }
    int q;cin >> q;
    while(q--) {
        int l, r;cin >> l >> r;l--;r--;
        vii x;
        set<pii> s;
        for(int i = l; i <= r;i++) {
            x.pb({a[i], i});
            s.insert({-b[i], i});
        }
        sort(all(x), greater<pii>());
        bool ok = 1;
        vi linkedto(n, -1);
        for(int i = 0; i < x.size();i++) {
            auto it = s.begin();
            pii p = *it;
            int cur = -p.ff, ind = p.ss;
            if(ind == x[i].ss) {
                if(s.size() == 1){ok = 0;break;}
                it++;
                p = *it;
                cur = -p.ff, ind = p.ss;
            }
            //cout << x[i].ss << " " << ind << endl;
            if(x[i].ff < cur) {
                ok = 0;
                break;
            }
            linkedto[ind] = x[i].ss;
            s.erase(it);
        }
        if(s.size() == 1){
            //auto it = s.begin();
            pii p = x.back();
            int cur = p.ff, ind = p.ss;
            for(int i = l; i <= r;i++) {
                if(ind == i)continue;
                int k = linkedto[i];
                if(a[ind] > b[i] && a[k] > b[ind]){
                    //cout << ind << " " << i << " " << k << endl;
                    ok = 1;
                    break;
                }
            }
        }
        cout << (ok ? "Yes": "No") << 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 (stderr)

Main.cpp: In function 'int32_t main()':
Main.cpp:76:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   76 |         for(int i = 0; i < x.size();i++) {
      |                        ~~^~~~~~~~~~
Main.cpp:97:17: warning: unused variable 'cur' [-Wunused-variable]
   97 |             int cur = p.ff, ind = p.ss;
      |                 ^~~
Main.cpp: In function 'void usaco_problem()':
Main.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);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Main.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);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp: In function 'void init()':
Main.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);
      | ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
Main.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 1: 4 / 4
• Subtask 2: 5 / 5
• Subtask 3: 10 / 10
• Subtask 4: 31 / 31
• Subtask 5: 0 / 8
• Subtask 6: 0 / 12
• Subtask 7: 0 / 18
• Subtask 8: 0 / 12