Concentric Tubes

input/code.cpp: In function 'void solve()':
input/code.cpp:57:18: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   57 |         if (mIdx != rads.size() && c_next[mIdx].first+1 > c_next[i+1].first)
      |             ~~~~~^~~~~~~~~~~~~~

#include <bits/stdc++.h>
 
 
#define int long long
using namespace std;
 
int p(int base, int power, int mod)
{
    if (power == 0)
        return 1;
    if (power % 2 == 0)
    {
        int r = p(base, power/2, mod);
        return (r*r) % mod;
    }
    else
        return (p(base, power-1, mod)*base) % mod;
}
 
int LCM(int a, int b)
{
    return (a / __gcd(a, b)) * b;
}
 
int mod = 1e9+7;
 
void solve()
{
    int n;
    cin >> n;
 
    vector<int> originalBigger(n);
    vector<pair<int, int>> rads(n);
 
    for (int i = 0; i < n; i++)
    {
        int a;
        cin >> a;
        rads[i].first = a;
    }
    for (int i = 0; i < n; i++)
    {
        int a;
        cin >> a;
        originalBigger[i] = a;
        rads[i].second = i;
    }
 
 
    std::sort(rads.begin(), rads.end());
 
    vector<pair<int, int>> c_next(n+1);
    c_next[n] = {0, 0};
    for (int i = n-1; i >= 0; i--)
    {
        int mIdx = (int)(lower_bound(rads.begin(), rads.end(), pair<int, int>{originalBigger[rads[i].second], 0}) - rads.begin());
        if (mIdx != rads.size() && c_next[mIdx].first+1 > c_next[i+1].first)
        {
            c_next[i] = {c_next[mIdx].first+1, mIdx};
        }
        else
        {
            c_next[i] = {c_next[i+1].first, i+1};
            if (c_next[i].first == 0)
                c_next[i] = {1, -1};
        }
    }
    
    cout << c_next[0].first << '\n';
 
    int i = 0;
    while(i != -1 && i < n+1)
    {
        if (c_next[i].first > c_next[i+1].first)
            cout << rads[i].second+1 << ' ';
        i = c_next[i].second;
    }
    
} 
 
signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
 
    int t = 1;
 
    //cin >> t;
 
    for (int i = 0; i < t; i++)
    {
        solve();
        //cout.flush();
    }
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED

Test 16

Verdict: ACCEPTED

Test 17

Verdict: ACCEPTED

Test 18

Verdict: ACCEPTED