Submission #1177099

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1177099	2025-04-01 09:26:03	Agageldi	Jakarta Skyscrapers (APIO15_skyscraper)	C++20	0 / 100	1 ms	1864 KiB

skyscraper

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 N 30005
#define ll long long
#define ff first
#define ss second
#define pb push_back
#define SZ(v) (int)v.size()
int n, m, ans = INT_MAX, vis[N], j[N], dp[300001], pos[300001];
vector <int> v[N], v1[N];
void solve(int dog) {
  if(abs(pos[dog] - pos[1]) % j[dog] == 0){
    dp[pos[1]] = min(dp[pos[1]], dp[pos[dog]] + abs(pos[dog] - pos[1]) / j[dog]);
    return;
  }
  if(vis[dog]) return;
  vis[dog] = 1;
  for(auto i : v[dog]) {
    if(dp[i] < dp[pos[dog]] + abs(i - pos[dog]) / j[dog]){
      dp[i] = dp[pos[dog]] + abs(i - pos[dog]) / j[dog];
      for(auto k : v1[i]) {
        solve(k);
      }
    }
  }
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 0 / 10
• Subtask 2: 0 / 12
• Subtask 3: 0 / 14
• Subtask 4: 0 / 21
• Subtask 5: 0 / 43