제출 #766410

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
766410	2023-06-25 15:55:15	vito	Jakarta Skyscrapers (APIO15_skyscraper)	C++98	0 / 100	126 ms	262144 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;
using ll=long long;
const ll INF=1e18+5;
const int MAXN=2005;
const int MAXM=3e4+5;
#define F first
#define S second
vector<pair<int, int>> a(MAXM);
int n, m;
ll dp[MAXM][MAXN];
vector<vector<int>> wh(MAXN);
void dfs(int x, int y) { // x je koji covik a y je koja pozicija
  for(int i=y+a[x].S; i<n; i+=a[x].S) {
    dp[x][i]=min(dp[x][i], dp[x][y]+(i-y)/a[x].S);
    for(auto &z : wh[i]) {
      if(dp[z][i]>dp[x][y]+(i-y)/a[x].S) {
        dp[z][i]=dp[x][y]+(i-y)/a[x].S;
        dfs(z, i);
      }
    }
  }
  for(int i=y-a[x].S; i>=0; i-=a[x].S) {
    dp[x][i]=min(dp[x][i], dp[x][y]+(y-i)/a[x].S);
    for(auto &z : wh[i]) {
      if(dp[z][i]>dp[x][y]+(y-i)/a[x].S) {
        dp[z][i]=dp[x][y]+(y-i)/a[x].S;
        dfs(z, i);
      }
    }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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