제출 #1096464

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1096464		cpptowin	Robot (JOI21_ho_t4)	C++17	0 / 100	231 ms	191232 KiB

Main

#include <bits/stdc++.h>
#define fo(i, d, c) for (int i = d; i <= c; i++)
#define fod(i, c, d) for (int i = c; i >= d; i--)
#define maxn 1000010
#define N 1010
#define fi first
#define se second
#define pb emplace_back
#define en cout << "\n";
#define int long long
#define inf (int)1e18
#define bitcount(x) __builtin_popcountll(x)
#define pii pair<int, int>
#define vii vector<pii>
#define lb(x) x & -x
#define bit(i, j) ((i >> j) & 1)
#define offbit(i, j) (i ^ (1LL << j))
#define onbit(i, j) (i | (1LL << j))
#define vi vector<int>
#define all(x) x.begin(), x.end()
#define ss(x) (int)x.size()
template <typename T1, typename T2>
bool minimize(T1 &a, T2 b)
{
    if (a > b)
    {
        a = b;
        return true;
    }
    return false;
}
template <typename T1, typename T2>
bool maximize(T1 &a, T2 b)
{
    if (a < b)
    {
        a = b;
        return true;
    }
    return false;
}
using namespace std;
const int nsqrt = 450;
const int mod = 1e9 + 7;
void add(int &x, int k)
{
    x += k;
    x %= mod;
    if (x < 0)
        x += mod;
}
void del(int &x, int k)
{
    x -= k;
    x %= mod;
    if (x < 0)
        x += mod;
}
vector<array<int, 3>> ke[maxn];
map<int, vii> adj[maxn];
int n, m;
map<int, int> dp2[maxn], f[maxn];
int dp1[maxn];
void dij()
{
    fo(i, 2, n) dp1[i] = inf;
    priority_queue<array<int, 3>, vector<array<int, 3>>, greater<array<int, 3>>> q;
    q.push({0, 1, 0});
    while (ss(q))
    {
        auto [du, u, color] = q.top();
        q.pop();
        if (color)
        {
            if (dp2[u][color] != du)
                continue;
            for (auto [v, p] : adj[u][color])
            {
                int cost = f[u][color] - p;
                if (dp1[v] < du + cost)
                {
                    dp1[v] = du + cost;
                    q.push({dp1[v], v, 0});
                }
            }
        }
        else
        {
            if (dp1[u] != du)
                continue;
            for (auto [v, c, p] : ke[u])
            {
                if (minimize(dp1[v], du + p))
                {
                    q.push({dp1[v], v, 0});
                }
                if (!dp2[v].count(c) or dp2[v][c] > du)
                {
                    dp2[v][c] = du;
                    q.push({du, v, c});
                }
                if (minimize(dp1[v], du + f[u][c] - p))
                {
                    q.push({dp1[v], v, 0});
                }
            }
        }
    }
}
main()
{
#define name "TASK"
    if (fopen(name ".inp", "r"))
    {
        freopen(name ".inp", "r", stdin);
        freopen(name ".out", "w", stdout);
    }
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cin >> n >> m;
    fo(i, 1, m)
    {
        int u, v, c, p;
        cin >> u >> v >> c >> p;
        ke[u].push_back({v, c, p});
        ke[v].push_back({u, c, p});
        adj[u][c].pb(v, p);
        adj[v][c].pb(u, p);
        f[u][c] += p;
        f[v][c] += p;
    }
    dij();
    if (dp1[n] != inf)
        cout << dp1[n];
    else
        cout << -1;
}

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

Main.cpp:110:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  110 | main()
      | ^~~~
Main.cpp: In function 'int main()':
Main.cpp:115:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  115 |         freopen(name ".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:116:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  116 |         freopen(name ".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 0 / 34
• Subtask 2: 0 / 24
• Subtask 3: 0 / 42