제출 #169337

#제출 시각아이디문제언어결과실행 시간메모리
169337MilkiJakarta Skyscrapers (APIO15_skyscraper)C++14
36 / 100
467 ms262148 KiB
#include<bits/stdc++.h> using namespace std; #define FOR(i, a, b) for(int i = a; i < b; ++i) #define REP(i, n) FOR(i, 0, n) #define _ << " " << #define sz(x) ((int) x.size()) #define pb(x) push_back(x) #define TRACE(x) cerr << #x << " = " << x << endl typedef long long ll; typedef pair<int, int> point; const int mod = 1e9 + 7; int add(int x, int y) {x += y; if(x >= mod) return x - mod; return x;} int sub(int x, int y) {x -= y; if(x < 0) return x + mod; return x;} int mul(int x, int y) {return (ll) x * y % mod;} const int MAXN = 3e4 + 5; int n, m, dist[MAXN], start[MAXN]; set<int> S[MAXN]; vector <point> E[MAXN]; void update(int pos, int range){ int cnt = 1; for(int i = pos + range; i < n; i += range){ E[pos].pb(point(i, cnt)); if(S[i].find(cnt) != S[i].end()) break; cnt ++; } cnt = 1; for(int i = pos - range; i >= 0; i -= range){ E[pos].pb(point(i, cnt)); if(S[i].find(cnt) != S[i].end()) break; cnt ++; } } int dijkstra(){ priority_queue <point> Q; Q.push(point(0, start[0])); vector <int> d(MAXN, -1); while(!Q.empty()){ while(!Q.empty() && d[Q.top().second] != -1) Q.pop(); if(Q.empty()) break; auto tmp = Q.top(); Q.pop(); int distance = -tmp.first; int cvor = tmp.second; d[cvor] = distance; for(auto e : E[cvor]){ int ncvor = e.first, ndist = e.second; if(d[ncvor] != -1) continue; Q.push(point( -(distance + ndist), ncvor)); } } return d[start[1]]; } int main(){ ios_base::sync_with_stdio(false); cin.tie(0); cin >> n >> m; REP(i, m){ cin >> start[i] >> dist[i]; S[start[i]].insert(dist[i]); } REP(i, m){ update(start[i], dist[i]); } cout << dijkstra(); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...