oj.uz

답안 #698564

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
698564 2023-02-13T19:59:43 Z Filya Autobus (COCI22_autobus) C++14
55 / 70
 1000 ms 7200 KB 
/////////////////////include/////////////////////
//#include <bits/stdc++.h>
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <cassert>
#include <set>
#include <map>
#include <unordered_map>
#include <vector>
#include <stack>
#include <queue>
#include <iomanip>
#include <bitset>
#include <stdio.h>
#include <climits>
#include <numeric>
using namespace std;
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//using namespace __gnu_pbds;
//template <typename T>
//using ordered_set = tree <T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
/////////////////////define/////////////////////
#define ci(x) if(x) cout << "YES" << '\n'; else cout << "NO" << '\n';
#define cii(x) if(check(x))
#define MOD 1000000007
#define MOD2 998244353
#define oo 1e9
#define ool 1e18L
#define pii pair<int, int>
#define pll pair<long long, long long>
#define mii map<int, int>
#define vi vector<int>
#define vpi vector<pair<int, int>>
#define vll vector <ll>
#define ff first
#define ss second
#define mp make_pair
#define ll long long
#define ld long double
#define pb push_back
#define eb emplace_back
#define pob pop_back
#define lb lower_bound
#define ub upper_bound
#define bs binary_search
#define sz(x) (int((x).size()))
#define all(x) (x).begin(), (x).end()
#define alll(x) (x), (x) + n
#define clr(x) (x).clear();
#define fri(x) for(int i = 0; i < x; ++i)
#define frj(x) for(int j = 0; j < x; ++j)
#define frp(x) for(int p = 0; p < x; ++p)
#define frr(a, b) for(int i = a; i < b; ++i)
#define frrj(a, b) for(int j = a; j < b; ++j)
#define fra(x) for(int i = 0; i < x; ++i) cin >> a[i];
#define frb(x) for(int i = 0; i < x; ++i) cin >> b[i];
#define frs(x) for(auto it = x.begin(); it != x.end(); ++it)
#define fr(x) for(auto it : x) //el
#define fastio ios_base::sync_with_stdio(false); cin.tie(0);
#define dbg(x) cerr << #x << ": " << x << endl;
#define ce(x) cout << x << endl;
#define uniq(x) x.resize(unique(all(x)) - x.begin()); //make all one after sorting
#define blt __builtin_popcount
/////////////////////print array, vector, deque, set, multiset, pair, map /////////////////////
void print(long long t) {cerr << t;}
void print(int t) {cerr << t;}
void print(string t) {cerr << t;}
void print(char t) {cerr << t;}
void print(double t) {cerr << t;}
void print(long double t) {cerr << t;}
void print(unsigned long long t) {cerr << t;}
template <class T, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";}
template <class T, class V> void print(T v[],V n) {cerr << "["; for(int i = 0; i < n; i++) {print(v[i]); cerr << " "; } cerr << "]"; cout << endl;}
template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(stack <T> v) {cerr << "[ "; stack<T> s = v; while(s.size()) {T i = s.top(); print(i); s.pop(); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(queue <T> v) {cerr << "[ "; queue<T> s = v; while(s.size()) {T i = s.front(); print(i); s.pop(); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(deque <T> v) {cerr << "[ "; deque<T> s = v; while(s.size()) {T i = s.front(); print(i); s.pop_front(); cerr << " ";} cerr << "]"; cout << endl;}
template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
template <class T, class V> void print(unordered_map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
/////////////////////code/////////////////////
const int N = 75;
int a[N];
set<pii> g[N], gr[N];
ll ans[N][N], newans[N][N];
ll n, m, k, q, x, y, l;

int main() {
    fastio;
    cin >> n >> m;
    for(x = 1; x <= n; x++) {
        for(y = 1; y <= n; y++) {
            if(x == y) continue;
            ans[x][y] = 1e18;
        }
    }
    fri(m) {
        cin >> x >> y >> l;
        if(ans[x][y] == 1e18) {
            g[x].insert({y, l});
            gr[y].insert({x, l});
            ans[x][y] = l;
        }
        else if(ans[x][y] > l) {
            g[x].erase({y, ans[x][y]});
            gr[y].erase({x, ans[x][y]});
            g[x].insert({y, l});
            gr[y].insert({x, l});
            ans[x][y] = l;
        }
    }
    cin >> k >> q;
    frr(2, k + 1) {
        for(x = 1; x <= n; x++) {
            for(y = 1; y <= n; y++) {
                newans[x][y] = ans[x][y];
            }
        }
        for(x = 1; x <= n; x++) {
            for(y = 1; y <= n; y++) {
                if(x == y) continue;
                for(auto z : gr[y]) {
                    newans[x][y] = min(newans[x][y], ans[x][z.ff] + z.ss);
                }
            }
        }
        for(x = 1; x <= n; x++) {
            for(y = 1; y <= n; y++) {
                ans[x][y] = newans[x][y];
            }
        }
    }
    while(q--) {
        cin >> x >> y;
        if(ans[x][y] == 1e18) cout << -1 << '\n';
        else cout << ans[x][y] << '\n';
    }
    return 0;
}

//	           ♥ ♥ ♥  ♥  ♥    ♥   ♥    ♥
//	           ♥      ♥  ♥     ♥ ♥    ♥ ♥
//	           ♥ ♥ ♥  ♥  ♥      ♥    ♥   ♥
//	           ♥      ♥  ♥      ♥   ♥ ♥ ♥ ♥
//	           ♥      ♥  ♥ ♥ ♥  ♥  ♥       ♥
//
//        God loves Fil, Fil accepts God's will

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 2 ms 468 KB Output is correct
3 Correct 3 ms 468 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 3 ms 468 KB Output is correct
6 Correct 7 ms 724 KB Output is correct
7 Correct 8 ms 724 KB Output is correct

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 5 ms 468 KB Output is correct
8 Correct 27 ms 468 KB Output is correct
9 Correct 3 ms 468 KB Output is correct
10 Correct 23 ms 468 KB Output is correct
11 Correct 24 ms 708 KB Output is correct
12 Correct 100 ms 696 KB Output is correct
13 Correct 102 ms 848 KB Output is correct
14 Correct 114 ms 820 KB Output is correct
15 Correct 321 ms 844 KB Output is correct
16 Correct 174 ms 6980 KB Output is correct
17 Correct 101 ms 7040 KB Output is correct
18 Correct 102 ms 7076 KB Output is correct
19 Correct 359 ms 7072 KB Output is correct
20 Correct 275 ms 7056 KB Output is correct
21 Correct 102 ms 7060 KB Output is correct
22 Correct 136 ms 7076 KB Output is correct
23 Correct 132 ms 7068 KB Output is correct
24 Correct 251 ms 7192 KB Output is correct
25 Correct 99 ms 7188 KB Output is correct
26 Correct 151 ms 7200 KB Output is correct
27 Correct 185 ms 7192 KB Output is correct
28 Correct 157 ms 7188 KB Output is correct
29 Correct 110 ms 6932 KB Output is correct
30 Correct 159 ms 6936 KB Output is correct
31 Correct 237 ms 6980 KB Output is correct
32 Correct 387 ms 6944 KB Output is correct

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 2 ms 468 KB Output is correct
9 Correct 3 ms 468 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 3 ms 468 KB Output is correct
12 Correct 7 ms 724 KB Output is correct
13 Correct 8 ms 724 KB Output is correct
14 Correct 5 ms 468 KB Output is correct
15 Correct 27 ms 468 KB Output is correct
16 Correct 3 ms 468 KB Output is correct
17 Correct 23 ms 468 KB Output is correct
18 Correct 24 ms 708 KB Output is correct
19 Correct 100 ms 696 KB Output is correct
20 Correct 102 ms 848 KB Output is correct
21 Correct 114 ms 820 KB Output is correct
22 Correct 321 ms 844 KB Output is correct
23 Correct 174 ms 6980 KB Output is correct
24 Correct 101 ms 7040 KB Output is correct
25 Correct 102 ms 7076 KB Output is correct
26 Correct 359 ms 7072 KB Output is correct
27 Correct 275 ms 7056 KB Output is correct
28 Correct 102 ms 7060 KB Output is correct
29 Correct 136 ms 7076 KB Output is correct
30 Correct 132 ms 7068 KB Output is correct
31 Correct 251 ms 7192 KB Output is correct
32 Correct 99 ms 7188 KB Output is correct
33 Correct 151 ms 7200 KB Output is correct
34 Correct 185 ms 7192 KB Output is correct
35 Correct 157 ms 7188 KB Output is correct
36 Correct 110 ms 6932 KB Output is correct
37 Correct 159 ms 6936 KB Output is correct
38 Correct 237 ms 6980 KB Output is correct
39 Correct 387 ms 6944 KB Output is correct
40 Correct 5 ms 468 KB Output is correct
41 Execution timed out 1082 ms 468 KB Time limit exceeded
42 Halted 0 ms 0 KB -