oj.uz

Submission #241934

# Submission time Handle Problem Language Result Execution time Memory
241934 2020-06-26T11:19:50 Z osaaateiasavtnl Railway Trip (JOI17_railway_trip) C++17
5 / 100
 2000 ms 7952 KB 
#include<bits/stdc++.h>
using namespace std;
#define ii pair <int, int>
#define app push_back
#define all(a) a.begin(), a.end()
#define bp __builtin_popcountll
#define ll long long
#define mp make_pair
#define f first
#define s second
#define Time (double)clock()/CLOCKS_PER_SEC

const int N = 1e5+7;
int a[N];
vector <int> g[N];
int d[N];

int dist(int S, int T) {
    for (int i = 0; i < N; ++i)
        d[i] = N;
    d[S] = 0;
    queue <int> q; q.push(S);
    while (q.size()) {
        int u = q.front(); q.pop();
        if (u == T)
            return d[u];

        for (int v : g[u])
            if (d[u]+1 < d[v]) {
                d[v] = d[u]+1;
                q.push(v);
            }   
    }   
    cout << "LMAO" << endl;
    exit(1);
}   

signed main() {
    #ifdef HOME
    freopen("input.txt", "r", stdin);
    #else
    #define endl '\n'
    ios_base::sync_with_stdio(0); cin.tie(0);
    #endif

    int n, k, q;
    cin >> n >> k >> q;
    for (int i = 1; i <= n; ++i)
        cin >> a[i];

    while (q--) {
        int l, r;
        cin >> l >> r;
        if (r < l)  
            swap(l, r);
    
        if (l == r) {
            cout << -1 << endl;
            continue;
        }                   

        vector <int> p = {l, r};

        {
        int mx = a[l];
        for (int i = l-1; i; --i) {
            if (a[i] >= mx) {
                p.app(i);
                mx = a[i];
            }   
        }
        }   

        if (l + 1 < r) {
            int pos = l+1;
            for (int i = l + 1; i < r; ++i) 
                if (a[i] > a[pos])  
                    pos = i;
            int mx = -1;
            for (int i = l + 1; i < pos; ++i) {
                if (a[i] >= mx) {
                    p.app(i);
                    mx = a[i];
                }   
            }   
            mx = -1;
            for (int i = r - 1; i > pos; --i) {
                if (a[i] >= mx) {
                    p.app(i);
                    mx = a[i];
                }   
            }   
            p.app(pos);
        }   

        {
        int mx = a[r];
        for (int i = r + 1; i <= n; ++i) {
            if (a[i] >= mx) {
                p.app(i);
                mx = a[i];
            }   
        }
        }

        sort(all(p));

        /*
        cout << "p : ";
        for (auto e : p)
            cout << e << ' ';
        cout << endl;
        */

        int u = -1, v = -1;
        for (int i = 0; i < p.size(); ++i) {
            if (p[i] == l) {
                u = i;
            }   
            if (p[i] == r) {
                v = i;
            }   
        }   

        for (int i = 0; i < N; ++i)
            g[i].clear();

        for (int i = 0; i < p.size(); ++i) {
            for (int j = i - 1; j >= 0; --j) {
                if (a[p[j]] >= a[p[i]]) {
                    //cout << p[i] << ' ' << p[j] << endl;
                    g[i].app(j);
                    g[j].app(i);
                    break;
                }   
            }   
            for (int j = i + 1; j < p.size(); ++j) {
                if (a[p[j]] >= a[p[i]]) {
                    //cout << p[i] << ' ' << p[j] << endl;
                    g[i].app(j);
                    g[j].app(i);
                    break;
                }   
            }   
        }   

        cout << dist(u, v) - 1 << endl;
    }   
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 3072 KB Output is correct
2 Correct 11 ms 3072 KB Output is correct
3 Correct 11 ms 3072 KB Output is correct
4 Correct 12 ms 3072 KB Output is correct
5 Correct 13 ms 3072 KB Output is correct
6 Correct 13 ms 3072 KB Output is correct
7 Correct 13 ms 3072 KB Output is correct
8 Correct 12 ms 3072 KB Output is correct
9 Correct 13 ms 3072 KB Output is correct

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 3072 KB Output is correct
2 Correct 96 ms 3936 KB Output is correct
3 Correct 79 ms 3712 KB Output is correct
4 Correct 53 ms 3584 KB Output is correct
5 Correct 46 ms 3456 KB Output is correct
6 Correct 40 ms 3456 KB Output is correct
7 Correct 44 ms 3456 KB Output is correct
8 Correct 586 ms 7688 KB Output is correct
9 Execution timed out 2081 ms 7952 KB Time limit exceeded
10 Halted 0 ms 0 KB -

Subtask #3
0 / 25.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2082 ms 4324 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 55.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2074 ms 3536 KB Time limit exceeded
2 Halted 0 ms 0 KB -