oj.uz

Submission #1102343

# Submission time Handle Problem Language Result Execution time Memory
1102343 2024-10-18T02:57:29 Z LTTrungCHL Airplane (NOI23_airplane) C++17
41 / 100
 401 ms 13452 KB 
///***LTT***///
/// ->NHAT QUOC GIA<- ///
#include<bits/stdc++.h>
//#pragma GCC optimize ("O3")
//#pragma GCC optimize ("unroll-loops")
//#pragma GCC target("popcnt")
//#define int long long
#define endl "\n"
#define F first
#define S second
#define pb push_back
using namespace std;
vector <int> lg2;
//void MAKE_LOG_ARR(int n){
//    lg2.resize(n + 3);
//    for (int i = 1;i <= n;++i){
//        lg2[i] = __lg(i);
//    }
//}
const long long oo = 1e9+7;
const int N = 2 * 1e5 + 10;
int n, a[N], m;
vector <int> adj[N];
namespace sub{
    long long dis[N];
    priority_queue <pair <long long, int>> pq;
    void solve(){
        long long ans = oo * oo;
        for (int i = 1;i <= n;++i){
            for (int j = 1;j <= n;++j){
                dis[j] = oo * oo;
            }
            dis[1] = 0;
            pq.push({0,1});
            while (!pq.empty()){
                int u = pq.top().S;
                long long d = -pq.top().F;
                pq.pop();
                for (int v : adj[u]){
                    if (a[v] > a[i]) continue;
                    int nxt = (d < a[v] ? a[v] : d + 1);
                    if (nxt < dis[v]){
                        dis[v] = nxt;
                        pq.push({-dis[v], v});
                    }
                }
            }
            long long res = dis[i];

//            cout << i <<" "<< res <<"\n";
            for (int j = 1;j <= n;++j){
                dis[j] = oo * oo;
            }
            dis[n] = 0;
            pq.push({0,n});
            while (!pq.empty()){
                int u = pq.top().S;
                long long d = -pq.top().F;
                pq.pop();
                for (int v : adj[u]){
                    if (a[v] > a[i]) continue;
                    int nxt = (d < a[v] ? a[v] : d + 1);
                    if (nxt < dis[v]){
                        dis[v] = nxt;
                        pq.push({-dis[v], v});
                    }
                }
            }
            res += dis[i];
//            cout << i <<" "<< res <<" "<< dis[9] <<"\n";
            ans = min(ans, res);
        }
        cout << ans;
    }
};
void solve(){
    cin >> n >> m;
    for (int i = 1;i <= n;++i){
        cin >> a[i];
    }
    for (int i = 1;i <= m;++i){
        int u, v;
        cin >> u >> v;
        adj[u].pb(v);
        adj[v].pb(u);
    }
    if (n <= 2000 and m <= 4000){
        sub::solve();
        return;
    }
    return;
}
int main(){
    ios_base::sync_with_stdio(NULL);
    cin.tie(NULL);
    cout.tie(NULL);
    if (fopen("ltt.inp", "r")){
        freopen("ltt.inp", "r", stdin);
        freopen("ltt.out", "w", stdout);
    }
//    int t;
//    cin >> t;
//    while(t--){
    solve();
//    }
    return 0;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:98:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   98 |         freopen("ltt.inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:99:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   99 |         freopen("ltt.out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6480 KB Output is correct
2 Incorrect 50 ms 13452 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6480 KB Output is correct
2 Correct 2 ms 6480 KB Output is correct
3 Correct 2 ms 6480 KB Output is correct
4 Correct 2 ms 6480 KB Output is correct
5 Correct 2 ms 6480 KB Output is correct
6 Correct 10 ms 6700 KB Output is correct
7 Correct 78 ms 6704 KB Output is correct
8 Correct 31 ms 6480 KB Output is correct
9 Correct 189 ms 6480 KB Output is correct
10 Correct 46 ms 6480 KB Output is correct
11 Correct 208 ms 6480 KB Output is correct
12 Correct 68 ms 6480 KB Output is correct
13 Correct 243 ms 6708 KB Output is correct
14 Correct 315 ms 6736 KB Output is correct
15 Correct 401 ms 6736 KB Output is correct
16 Correct 393 ms 6752 KB Output is correct
17 Correct 376 ms 6736 KB Output is correct
18 Correct 1 ms 6480 KB Output is correct

Subtask #3
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6480 KB Output is correct
2 Correct 2 ms 6480 KB Output is correct
3 Correct 2 ms 6480 KB Output is correct
4 Correct 2 ms 6480 KB Output is correct
5 Correct 2 ms 6480 KB Output is correct
6 Correct 10 ms 6700 KB Output is correct
7 Correct 78 ms 6704 KB Output is correct
8 Correct 31 ms 6480 KB Output is correct
9 Correct 189 ms 6480 KB Output is correct
10 Correct 46 ms 6480 KB Output is correct
11 Correct 208 ms 6480 KB Output is correct
12 Correct 68 ms 6480 KB Output is correct
13 Correct 243 ms 6708 KB Output is correct
14 Correct 315 ms 6736 KB Output is correct
15 Correct 401 ms 6736 KB Output is correct
16 Correct 393 ms 6752 KB Output is correct
17 Correct 376 ms 6736 KB Output is correct
18 Correct 1 ms 6480 KB Output is correct
19 Correct 56 ms 6712 KB Output is correct
20 Correct 20 ms 6480 KB Output is correct
21 Correct 74 ms 6480 KB Output is correct
22 Correct 142 ms 6728 KB Output is correct
23 Correct 25 ms 6480 KB Output is correct
24 Correct 95 ms 6480 KB Output is correct
25 Correct 170 ms 6704 KB Output is correct
26 Correct 275 ms 6740 KB Output is correct
27 Correct 306 ms 6736 KB Output is correct
28 Correct 241 ms 6736 KB Output is correct
29 Correct 345 ms 6736 KB Output is correct
30 Correct 340 ms 6736 KB Output is correct

Subtask #4
0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6480 KB Output is correct
2 Incorrect 50 ms 13452 KB Output isn't correct
3 Halted 0 ms 0 KB -