oj.uz

Submission #1107544

# Submission time Handle Problem Language Result Execution time Memory
1107544 2024-11-01T12:34:52 Z chaoslong Crocodile's Underground City (IOI11_crocodile) C++14
46 / 100
 221 ms 262144 KB 
// Calm down.
// Think three times, code twice.
#include "bits/stdc++.h"
#include "crocodile.h"
#define forr(_a,_b,_c) for(int _a = (_b); _a <= (_c); ++_a)
#define ford(_a,_b,_c) for(int _a = (_b) + 1; _a --> (_c);)
#define forf(_a,_b,_c) for(int _a = (_b); _a < (_c); ++_a)
#define st first
#define nd second
#define ll long long
#define ull unsigned long long
#define pii pair <int,int>
#define pll pair <ll,ll>
#define piii pair <int,pii>
#define vi vector <int>
#define pb push_back
#define mp make_pair
#define all(x) begin(x),end(x)
#define mask(i) (1LL << (i))
#define bit(x, i) (((x) >> (i)) & 1)
#define bp __builtin_popcountll
#define file "test"

using namespace std;
const int N = 1e6 + 5;
const int mod = 1e9 + 7; // 998244353
const ll oo = 1e18;

int d[N][2];
bool check[N];
vector<pii> a[N];

void dfs(int u, int par) {
    for(pii e: a[u]) {
        int v = e.nd; ll dv = e.st;
        if(v == par) continue;
        dfs(v, u);
        if(check[v]) {
            if(dv < d[u][0]) {
                int tmp = d[u][0];
                d[u][0] = dv;
                d[u][1] = tmp;
            } else if(dv < d[u][1]) {
                d[u][1] = dv;
            }
        }
        if(d[v][1] + dv < d[u][0]) {
            int tmp = d[u][0];
            d[u][0] = d[v][1] + dv;
            d[u][1] = tmp;
        } else if(d[v][1] + dv< d[u][1]) {
            d[u][1] = d[v][1] + dv;
        }
//        cout << u << " " << v << " " << d[u][0] << " " << d[u][1] << "\n";
    }
}

//int n, m, r[N][2], l[N], k, p[N];
//int n, int m, int r[][2], int l[], int k, int p[]

int travel_plan(int n, int m, int r[][2], int l[], int k, int p[]) {
    forf(i, 0, m) {
        a[r[i][0]].pb({l[i], r[i][1]});
        a[r[i][1]].pb({l[i], r[i][0]});
    }
    forf(i, 0, k) {
        check[p[i]] = 1;
    }
    forf(i, 0, k) check[p[i]] = 1;
    memset(d, 63, sizeof d);
    dfs(0, 0);
    return d[0][1];
}

//signed main(){
//    ios_base::sync_with_stdio(0);cin.tie(0);
//    #ifdef LOCAL
//        freopen(file".inp","r",stdin);
//        freopen(file".out","w",stdout);
//    #endif
//    cin >> n >> m >> k;
//    forf(i, 0, m) {
//        cin >> r[i][0] >> r[i][1] >> l[i];
//    }
//    forf(i, 0, k) cin >> p[i];
//    int t = 1;
//    //cin >> t;
//    while(t--) cout << travel_plan();
//}
/*
1.self check:
2.long long
3.size of array
4.code for testing
5.initializing
6.modulo number
*/
/**
  ∧__∧
（｀•ω• )づ__∧
（つ　 /( •ω•。)
  しーＪ (nnノ) pat pat
**/
/**  /\_/\
*   (= ._.)
*   / >☕ \>💻
**/

Compilation message

crocodile.cpp:104:9: warning: "/*" within comment [-Wcomment]
  104 | /**  /\_/\
      |

Subtask #1
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 35408 KB Output is correct
2 Correct 7 ms 35408 KB Output is correct
3 Correct 7 ms 35408 KB Output is correct
4 Correct 6 ms 35512 KB Output is correct
5 Correct 7 ms 35664 KB Output is correct
6 Correct 6 ms 35576 KB Output is correct
7 Correct 6 ms 35408 KB Output is correct
8 Correct 7 ms 35408 KB Output is correct

Subtask #2
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 35408 KB Output is correct
2 Correct 7 ms 35408 KB Output is correct
3 Correct 7 ms 35408 KB Output is correct
4 Correct 6 ms 35512 KB Output is correct
5 Correct 7 ms 35664 KB Output is correct
6 Correct 6 ms 35576 KB Output is correct
7 Correct 6 ms 35408 KB Output is correct
8 Correct 7 ms 35408 KB Output is correct
9 Runtime error 221 ms 262144 KB Execution killed with signal 9
10 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 35408 KB Output is correct
2 Correct 7 ms 35408 KB Output is correct
3 Correct 7 ms 35408 KB Output is correct
4 Correct 6 ms 35512 KB Output is correct
5 Correct 7 ms 35664 KB Output is correct
6 Correct 6 ms 35576 KB Output is correct
7 Correct 6 ms 35408 KB Output is correct
8 Correct 7 ms 35408 KB Output is correct
9 Runtime error 221 ms 262144 KB Execution killed with signal 9
10 Halted 0 ms 0 KB -