Submission #739424

#	Time	Username	Problem	Language	Result	Execution time	Memory
739424		Username4132	Jakarta Skyscrapers (APIO15_skyscraper)	C++14	0 / 100	3 ms	3836 KiB

skyscraper

#include<iostream>
#include<vector>
#include<queue>
#include<set>
using namespace std;
#define forn(i, n) for(int i=0; i<(int)n; ++i)
#define PB push_back

struct node{
    int pos, hop, cost;
    node(int Pos, int Hop, int Cost) : pos(Pos), hop(Hop), cost(Cost) {}
};

const int MAXN=30010;
int n, m, start, target;
bool done[MAXN];
vector<int> ops[MAXN];
set<int> len[2][MAXN];
deque<node> Q;

void add(node v, bool mode){
    if(len[mode][v.pos].find(v.hop)==len[mode][v.pos].end()){
        len[mode][v.pos].insert(v.hop);
        if(mode) Q.push_back(v);
        else Q.push_front(v);
    }
}

int main(){
    scanf("%d %d", &n, &m);
    forn(i, m){
        int a, b; scanf("%d %d", &a, &b);
        ops[a].PB(b);
        if(i==0) start=a;
        if(i==1) target=a;
    }
    for(int doge:ops[start]) add(node(start, doge, 0), false);
    int ans=-1;
    while(!Q.empty()){
        node v = Q.front();
        Q.pop_front();
        if(v.pos==target) ans=v.cost;
        int le=v.pos-v.hop, ri=v.pos+v.hop;
        if(le>=0) add(node(le, v.hop, v.cost+1), true);
        if(ri<n) add(node(ri, v.hop, v.cost+1), true);
        if(!done[v.pos]){
            for(int wi:ops[v.pos]) add(node(v.pos, wi, v.cost), false);
            done[v.pos]=true;
        }
    }
    printf("%d\n", ans);
}

Compilation message (stderr)

skyscraper.cpp: In function 'int main()':
skyscraper.cpp:30:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 |     scanf("%d %d", &n, &m);
      |     ~~~~~^~~~~~~~~~~~~~~~~
skyscraper.cpp:32:24: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   32 |         int a, b; scanf("%d %d", &a, &b);
      |                   ~~~~~^~~~~~~~~~~~~~~~~

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