166062025-05-06 20:45:06algoproTornyokcpp17Wrong answer 0/100248ms13108 KiB
// UUID: c62a03b2-60e4-475c-96ed-b80e3fa1fde7
#pragma GCC optimize("O3,no-stack-protector")
#include <bits/stdc++.h>
using namespace std;

int n, k;
vector<int> numLess;
vector<vector<int>> nbrs;

int calcLess(int Indx){
    if(0<=numLess[Indx]) return numLess[Indx];
    int ans=0;
    for(int x : nbrs[Indx]) ans=max(ans, calcLess(x)+1);
    return numLess[Indx]=ans;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cin >> n >> k;
    vector<long long> sortedArr(n+k);
    vector<int> h(n+1), towerH(k);
    for(int i=0;i<n;i++){
        cin >> h[i];
        sortedArr[i]=(((long long)(h[i])<<32)|i);
    }
    for(int i=0;i<k;i++){
        cin >> towerH[i];
        sortedArr[n+i]=(((long long)(towerH[i])<<32)|n+i);
    }
    h[n]=INT_MAX;
    sort(sortedArr.begin(), sortedArr.end());
    cout << sortedArr[0] << endl;
}
SubtaskSumTestVerdictTimeMemory
base0/100
1Wrong answer0/01ms316 KiB
2Wrong answer0/0196ms10804 KiB
3Wrong answer0/21ms500 KiB
4Wrong answer0/21ms316 KiB
5Wrong answer0/61ms316 KiB
6Wrong answer0/61ms316 KiB
7Wrong answer0/410ms1088 KiB
8Wrong answer0/417ms1592 KiB
9Wrong answer0/857ms4916 KiB
10Wrong answer0/8109ms7480 KiB
11Wrong answer0/5204ms10292 KiB
12Wrong answer0/5236ms12088 KiB
13Wrong answer0/539ms2612 KiB
14Wrong answer0/583ms5172 KiB
15Wrong answer0/5104ms7732 KiB
16Wrong answer0/5163ms9128 KiB
17Wrong answer0/5196ms11004 KiB
18Wrong answer0/5240ms13000 KiB
19Wrong answer0/5246ms13108 KiB
20Wrong answer0/5211ms13108 KiB
21Wrong answer0/5200ms13108 KiB
22Wrong answer0/5248ms13108 KiB