Submission #1001405

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1001405	2024-06-19 02:58:32	aaaaaarroz	Jakarta Skyscrapers (APIO15_skyscraper)	C++17	0 / 100	0 ms	348 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;
typedef long long ll;
int main() {
    ll n,m;
    cin>>n>>m;
    vector<vector<ll>>dist(m,vector<ll>(n,LLONG_MAX));
    for(ll i=0;i<m;i++){
        ll b,p;
        cin>>b>>p;
        dist[i][b]=0;
        if(i==1){
            continue;
        }
        ll j=b-p;
        while(j>=0){
            dist[i][j]=dist[i][j+p]+1;
            j-=p;
        }
        j=b+p;
        while(j<n){
            dist[i][j]=dist[i][j-p]+1;
            j+=p;
        }
    }
    vector<vector<pair<ll,ll>>>graph(m,vector<pair<ll,ll>>());
    for(ll i=0;i<m;i++){
        for(ll j=i+1;j<m;j++){
            for(ll k=0;k<n;k++){
                if(dist[i][k]!=LLONG_MAX&&dist[j][k]!=LLONG_MAX){
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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