제출 #287264

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
287264		BeanZ	Jakarta Skyscrapers (APIO15_skyscraper)	C++14	57 / 100	90 ms	33948 KiB

skyscraper

#include <bits/stdc++.h>

using namespace std;

#define ll long long
#define endl '\n'
const int N = 5e5 + 5;
ll dp[2005][2005], vis[2005], u[30005], v[30005];
vector<ll> node[2005], E[2005];
struct viet{
        ll u, v, c;
        bool operator <(const viet &o) const{
                return c > o.c;
        }
};
int main(){
        ios_base::sync_with_stdio(false);
        cin.tie(0);
        if (fopen("VietCT.INP", "r")){
                freopen("VietCT.INP", "r", stdin);
                freopen("VietCT.OUT", "w", stdout);
        }
        ll n, m;
        cin >> n >> m;
        for (int i = 1; i <= m; i++){
                cin >> u[i] >> v[i];
                u[i]++;
                E[u[i]].push_back(i);
        }
        priority_queue<viet> q;
        for (int i = 1; i <= n; i++){
                for (int j = 1; j <= 2000; j++){
                        dp[i][j] = 1e9;
                }
        }
        for (auto j : E[u[1]]){
                q.push({u[j], v[j], 0});
                dp[u[j]][v[j]] = 0;
        }
        vis[1] = 1;
        while (q.size()){
                viet x = q.top();
                q.pop();
                if (x.c != dp[x.u][x.v]) continue;
                if ((x.u - x.v) > 0){
                        if (vis[x.u - x.v] == 0){
                                vis[x.u - x.v] = 1;
                                for (auto j : E[x.u - x.v]){
                                        q.push({x.u - x.v, v[j], x.c + 1});
                                        dp[x.u - x.v][v[j]] = x.c + 1;
                                }
                                q.push({x.u - x.v, x.v, x.c + 1});
                                dp[x.u - x.v][x.v] = x.c + 1;
                        } else {
                                if (dp[x.u - x.v][x.v] > (x.c + 1)){
                                        dp[x.u - x.v][x.v] = x.c + 1;
                                        q.push({x.u - x.v, x.v, x.c + 1});
                                }
                        }
                }
                if ((x.u + x.v) <= n){
                        if (vis[x.u + x.v] == 0){
                                vis[x.u + x.v] = 1;
                                for (auto j : E[x.u + x.v]){
                                        q.push({x.u + x.v, v[j], x.c + 1});
                                        dp[x.u + x.v][v[j]] = x.c + 1;
                                }
                                q.push({x.u + x.v, x.v, x.c + 1});
                                dp[x.u + x.v][x.v] = x.c + 1;
                        } else {
                                if (dp[x.u + x.v][x.v] > (x.c + 1)){
                                        dp[x.u + x.v][x.v] = x.c + 1;
                                        q.push({x.u + x.v, x.v, x.c + 1});
                                }
                        }
                }
        }
        ll ans = 1e9;
        for (int i = 1; i <= 2000; i++){
                ans = min(ans, dp[u[2]][i]);
        }
        if (ans == 1e9) cout << -1;
        else cout << ans;
}
/*
*/

컴파일 시 표준 에러 (stderr) 메시지

skyscraper.cpp: In function 'int main()':
skyscraper.cpp:20:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   20 |                 freopen("VietCT.INP", "r", stdin);
      |                 ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
skyscraper.cpp:21:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   21 |                 freopen("VietCT.OUT", "w", stdout);
      |                 ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

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