oj.uz

답안 #659123

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
659123 2022-11-16T16:01:01 Z ssense 악어의 지하 도시 (IOI11_crocodile) C++14
46 / 100
 14 ms 596 KB 
#include <bits/stdc++.h>
#include "crocodile.h"
#define startt ios_base::sync_with_stdio(false);cin.tie(0);
typedef long long  ll;
using namespace std;
#define vint vector<int>
#define all(v) v.begin(), v.end()
#define MOD 1000000007
#define MOD2 998244353
#define MX 1000000000
#define MXL 1000000000000000000
#define PI (ld)2*acos(0.0)
#define pb push_back
#define sc second
#define fr first
//#define int long long
#define endl '\n'
#define ld long double
#define NO cout << "NO" << endl
#define YES cout << "YES" << endl
int ceildiv(int one, int two) {if (one % two == 0) {return one / two;}else {return one / two + 1;}} int power(int n, int pow, int m) {if (pow == 0) return 1;if (pow % 2 == 0) {ll x = power(n, pow / 2, m);return (x * x) % m;}else return (power(n, pow - 1, m) * n) % m;} int gcd(int a, int b) { if (!b)return a; return gcd(b, a % b);} int factorial(int n, int mod) {if (n > 1)return (n * factorial(n - 1, mod)) % mod; else return 1;} int lcm(int a, int b) {return (a * b) / gcd(a, b);} vector<int> read(int n) {vector<int> a; for (int i = 0; i < n; i++) { int x; cin >> x; a.pb(x);} return a;}struct prefix_sum{vint pref;void build(vint a){pref.pb(0);for(int i = 0; i < a.size(); i++){pref.pb(pref.back()+a[i]);}}int get(int l, int r){return pref[r]-pref[l-1];}};//mesanu


int travel_plan(int n, int m, int r[][2], int l[], int k, int p[])
{
    vector<vector<pair<int, ll>>> adj(n, vector<pair<int, ll>>());
    vector<pair<bool, ll>> certified(n, {false, MXL});
    for(int i = 0; i < m; i++)
    {
        adj[r[i][1]].pb({r[i][0], l[i]});
        adj[r[i][0]].pb({r[i][1], l[i]});
    }
    for(int i = 0; i < k; i++)
    {
        certified[p[i]].fr = true;
        certified[p[i]].sc = 0;
    }
    for(int i = 0; i <= 2*n; i++)
    {
        for(int u = 0; u < n; u++)
        {
            ll best = MXL, scbest = MXL;
            for(auto node : adj[u])
            {
                int v = node.fr;
                int dist = node.sc;
                if(certified[v].fr)
                {
                    scbest = min(scbest, certified[v].sc+dist);
                    if(scbest < best)
                    {
                        swap(scbest, best);
                    }
                }
            }
            if(scbest != MXL)
            {
                certified[u].fr = true;
                certified[u].sc = scbest;
            }
        }
    }
    if(certified[0].fr)
    {
        //cout << "true" << endl;
        return certified[0].sc;
    }
    else
    {
        cout << "false" << endl;
        return -1;
    }
}
/*
int32_t main(){
    startt
    int n, m, k;
    cin >> n >> m;
    int r[m][2], l[m];
    for(int i = 0; i < m; i++)
    {
        cin >> r[i][0] >> r[i][1];
    }
    for(int i = 0; i < m ; i++)
    {
        cin >> l[i];
    }
    cin >> k;
    int p[k];
    for(int i = 0; i < k; i++)
    {
        cin >> p[i];
    }
    cout << travel_plan(n, m, r, l, k, p) << endl;
}
 */
/*
5 4
0 1
0 2
3 2
2 4
2
3
1
4
3
1
3
4

 */

Compilation message

crocodile.cpp: In member function 'void prefix_sum::build(std::vector<int>)':
crocodile.cpp:21:667: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   21 | int ceildiv(int one, int two) {if (one % two == 0) {return one / two;}else {return one / two + 1;}} int power(int n, int pow, int m) {if (pow == 0) return 1;if (pow % 2 == 0) {ll x = power(n, pow / 2, m);return (x * x) % m;}else return (power(n, pow - 1, m) * n) % m;} int gcd(int a, int b) { if (!b)return a; return gcd(b, a % b);} int factorial(int n, int mod) {if (n > 1)return (n * factorial(n - 1, mod)) % mod; else return 1;} int lcm(int a, int b) {return (a * b) / gcd(a, b);} vector<int> read(int n) {vector<int> a; for (int i = 0; i < n; i++) { int x; cin >> x; a.pb(x);} return a;}struct prefix_sum{vint pref;void build(vint a){pref.pb(0);for(int i = 0; i < a.size(); i++){pref.pb(pref.back()+a[i]);}}int get(int l, int r){return pref[r]-pref[l-1];}};//mesanu
      |                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                         ~~^~~~~~~~~~

Subtask #1
46.0 / 46.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 14 ms 428 KB Output is correct
5 Correct 14 ms 340 KB Output is correct
6 Correct 6 ms 396 KB Output is correct
7 Correct 14 ms 340 KB Output is correct
8 Correct 13 ms 440 KB Output is correct

Subtask #2
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 14 ms 428 KB Output is correct
5 Correct 14 ms 340 KB Output is correct
6 Correct 6 ms 396 KB Output is correct
7 Correct 14 ms 340 KB Output is correct
8 Correct 13 ms 440 KB Output is correct
9 Incorrect 10 ms 596 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 14 ms 428 KB Output is correct
5 Correct 14 ms 340 KB Output is correct
6 Correct 6 ms 396 KB Output is correct
7 Correct 14 ms 340 KB Output is correct
8 Correct 13 ms 440 KB Output is correct
9 Incorrect 10 ms 596 KB Output isn't correct
10 Halted 0 ms 0 KB -