Submission #479972

# Submission time Handle Problem Language Result Execution time Memory
479972 2021-10-14T04:01:05 Z Yuisuyuno Robot (JOI21_ho_t4) C++14
100 / 100
1053 ms 87644 KB
//Nguyen Huu Hoang Minh
#include <bits/stdc++.h>
#define sz(x) int(x.size())
#define all(x) x.begin(),x.end()
#define reset(x) memset(x, 0,sizeof(x))
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define N 2005
#define remain(x) if (x > MOD) x -= MOD
#define ii pair<int, int>
#define iiii pair< ii , ii >
#define viiii vector< iiii >
#define vi vector<int>
#define vii vector< ii >
#define bit(x, i) (((x) >> (i)) & 1)
#define Task "test"
#define int long long

using namespace std;

typedef long double ld;
const int inf = 1e10;
const int minf = -1e10;

int n, m;
struct edge{
    int to, c, p;
};
map<int, vector<edge>> g[100005];
int d[100005];
map<int,int> d2[100005], psum[100005];

void readfile()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);cout.tie(0);
    if (fopen(Task".inp","r"))
    {
        freopen(Task".inp","r",stdin);
        //freopen(Task".out","w",stdout);
    }
    cin >> n >> m;
    for(int i=1; i<=m; i++){
        int u, v, z, p;
        cin >> u >> v >> z >> p;
        g[u][z].pb({v,z,p});
        g[v][z].pb({u,z,p});
        psum[u][z]+=p;
        psum[v][z]+=p;
    }
}

void proc()
{
    memset(d, 0x3f, sizeof d);
    d[1]=0;
    priority_queue<tuple<int,int,int>> q;
    q.push({0,1,0});
    while (q.size()){
        int cost, node, c;
        tie(cost,node,c) = q.top();
        q.pop();
        if (c){
            if (d2[node][c]!=-cost) continue;
            for(edge i : g[node][c]){
                int case1 = psum[node][c]-i.p-cost;
                if (case1 < d[i.to]){
                    d[i.to] = case1;
                    q.push({-d[i.to],i.to,0});
                }
            }
        }
        else {
			if (d[node] != -cost) continue;
			for (auto& i : g[node]) {
				for (edge j : i.second) {
					// Case 1: We don't flip j
					int case1 = psum[node][j.c] - j.p - cost;
					if (case1 < d[j.to]) {
						d[j.to] = case1;
						q.push({-d[j.to], j.to, 0});
					}
					// Case 2: We flip j but not another edge of the same colour
					int case2 = j.p - cost;
					if (case2 < d[j.to]) {
						d[j.to] = case2;
						q.push({-d[j.to], j.to, 0});
					}
					// Case 3: We flip j and another edge of the same colour
					int case3 = -cost;
					if (!d2[j.to].count(j.c) || case3 < d2[j.to][j.c]) {
						d2[j.to][j.c] = case3;
						q.push({-d2[j.to][j.c], j.to, j.c});
					}
				}
			}
		}
    }
    cout << (d[n] > 1e18 ? -1 : d[n]);
}

signed main()
{
    readfile();
    proc();
    return 0;
}

Compilation message

Main.cpp: In function 'void readfile()':
Main.cpp:41:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   41 |         freopen(Task".inp","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 9 ms 15180 KB Output is correct
2 Correct 9 ms 15188 KB Output is correct
3 Correct 9 ms 15180 KB Output is correct
4 Correct 10 ms 15180 KB Output is correct
5 Correct 9 ms 15168 KB Output is correct
6 Correct 9 ms 15180 KB Output is correct
7 Correct 10 ms 15308 KB Output is correct
8 Correct 11 ms 15196 KB Output is correct
9 Correct 13 ms 15820 KB Output is correct
10 Correct 12 ms 15692 KB Output is correct
11 Correct 12 ms 15552 KB Output is correct
12 Correct 11 ms 15564 KB Output is correct
13 Correct 11 ms 15564 KB Output is correct
14 Correct 12 ms 15564 KB Output is correct
15 Correct 12 ms 15436 KB Output is correct
16 Correct 12 ms 15564 KB Output is correct
17 Correct 11 ms 15584 KB Output is correct
18 Correct 10 ms 15308 KB Output is correct
19 Correct 11 ms 15436 KB Output is correct
20 Correct 12 ms 15452 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 234 ms 35248 KB Output is correct
2 Correct 92 ms 25316 KB Output is correct
3 Correct 211 ms 32844 KB Output is correct
4 Correct 134 ms 28460 KB Output is correct
5 Correct 1049 ms 81888 KB Output is correct
6 Correct 748 ms 75316 KB Output is correct
7 Correct 384 ms 63560 KB Output is correct
8 Correct 464 ms 54296 KB Output is correct
9 Correct 489 ms 54188 KB Output is correct
10 Correct 370 ms 50292 KB Output is correct
11 Correct 142 ms 34368 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 9 ms 15180 KB Output is correct
2 Correct 9 ms 15188 KB Output is correct
3 Correct 9 ms 15180 KB Output is correct
4 Correct 10 ms 15180 KB Output is correct
5 Correct 9 ms 15168 KB Output is correct
6 Correct 9 ms 15180 KB Output is correct
7 Correct 10 ms 15308 KB Output is correct
8 Correct 11 ms 15196 KB Output is correct
9 Correct 13 ms 15820 KB Output is correct
10 Correct 12 ms 15692 KB Output is correct
11 Correct 12 ms 15552 KB Output is correct
12 Correct 11 ms 15564 KB Output is correct
13 Correct 11 ms 15564 KB Output is correct
14 Correct 12 ms 15564 KB Output is correct
15 Correct 12 ms 15436 KB Output is correct
16 Correct 12 ms 15564 KB Output is correct
17 Correct 11 ms 15584 KB Output is correct
18 Correct 10 ms 15308 KB Output is correct
19 Correct 11 ms 15436 KB Output is correct
20 Correct 12 ms 15452 KB Output is correct
21 Correct 234 ms 35248 KB Output is correct
22 Correct 92 ms 25316 KB Output is correct
23 Correct 211 ms 32844 KB Output is correct
24 Correct 134 ms 28460 KB Output is correct
25 Correct 1049 ms 81888 KB Output is correct
26 Correct 748 ms 75316 KB Output is correct
27 Correct 384 ms 63560 KB Output is correct
28 Correct 464 ms 54296 KB Output is correct
29 Correct 489 ms 54188 KB Output is correct
30 Correct 370 ms 50292 KB Output is correct
31 Correct 142 ms 34368 KB Output is correct
32 Correct 144 ms 33180 KB Output is correct
33 Correct 167 ms 33536 KB Output is correct
34 Correct 437 ms 53524 KB Output is correct
35 Correct 330 ms 44460 KB Output is correct
36 Correct 338 ms 49708 KB Output is correct
37 Correct 389 ms 53228 KB Output is correct
38 Correct 390 ms 62868 KB Output is correct
39 Correct 175 ms 37816 KB Output is correct
40 Correct 468 ms 55680 KB Output is correct
41 Correct 517 ms 55744 KB Output is correct
42 Correct 550 ms 64352 KB Output is correct
43 Correct 236 ms 39336 KB Output is correct
44 Correct 505 ms 47924 KB Output is correct
45 Correct 360 ms 50156 KB Output is correct
46 Correct 318 ms 49988 KB Output is correct
47 Correct 340 ms 52628 KB Output is correct
48 Correct 1053 ms 87644 KB Output is correct