Submission #1140135

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1140135	2025-01-26 10:15:30	AbdullahIshfaq	Flooding Wall (BOI24_wall)	C++20	58 / 100	5092 ms	29828 KiB

Main

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define MOD 1000000007
void solve(){
  int n;
  cin >> n;
  pair<ll,ll> arr[n];
  for(int i = 0; i < n; i++){
    cin >> arr[i].first;
  }
  for(int i = 0; i < n; i++){
    cin >> arr[i].second;
  }
  vector<pair<ll,ll>> rngs;
  for(int i = 0; i < n; i++){
    if(arr[i].first > arr[i].second){
      swap(arr[i].first, arr[i].second);
    }
    rngs.push_back({arr[i].first, i});
    rngs.push_back({arr[i].second, i});
  }
  sort(rngs.rbegin(), rngs.rend());
  ll ans = 0;
  int st[n], add1[n] = {}, add2[n] = {};
  for(int i = 0; i < n; i++){
    st[i] = 2;
  }
  for(auto [h, i] : rngs){
    ll res = 1;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 8 / 8
• Subtask 2: 17 / 17
• Subtask 3: 19 / 19
• Subtask 4: 14 / 14
• Subtask 5: 0 / 12
• Subtask 6: 0 / 30