oj.uz

Submission #1086786

# Submission time Handle Problem Language Result Execution time Memory
1086786 2024-09-11T13:24:42 Z AbdullahIshfaq Pilot (NOI19_pilot) C++14
28 / 100
 138 ms 6372 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define MOD 1000000007
ll tests = 1 , curr = 0;
const int N = 1000010;
int parent[N],Size[N];
int get_parent(int u){
    return ((u != parent[u]) ? parent[u] = get_parent(parent[u]) : u);
}
void union__(int u,int v){
    if((u = get_parent(u)) == (v = get_parent(v))){
        return ;
    }
    if (Size[u] < Size[v]){
        swap(u , v);
    }
    curr += Size[u] * 1ll * Size[v];
    parent[v] = u;
    Size[u] += Size[v];
}
void solve(){
    int n , q;
    cin >> n >> q;
    vector<pair<int,int>> tot;
    for(int i = 1 ;i <= n ;i++){
        int z;
        cin >> z;
        tot.push_back({z , -i});
    }
    for(int i = 1 ;i <= q ;i++){
        int z;
        cin >> z;
        tot.push_back({z , i});
    }
    sort(tot.begin(),tot.end());
    vector<ll> ans(q);
    for(int i = 0 ;i < n + q ;i ++){
        int b = tot[i].second;
        if(b > 0){
            ans[b] = curr;
        }
        else{
            b *= -1;
            curr++;
            parent[b] = b;
            Size[b] = 1;
            if(parent[b + 1]){
                union__(b , b + 1);
            }
            if(parent[b - 1]){
                union__(b , b - 1);
            }
        }
    }
    for(int i = 1; i<= q; i++){
        cout << ans[i] << endl;
    }
    
    
}
int main(){
    // ios_base::sync_with_stdio(0);
    // cin.tie(0);
    // cout.tie(0);
    // cin>>tests;
    // for(int i=0;i<tests;i++){
        solve();
    // }
}

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct

Subtask #2
10.0 / 10.0

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

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Runtime error 1 ms 604 KB Execution killed with signal 6
18 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Runtime error 1 ms 604 KB Execution killed with signal 6
18 Halted 0 ms 0 KB -

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 1964 KB Output is correct
2 Correct 27 ms 1988 KB Output is correct
3 Correct 24 ms 1992 KB Output is correct
4 Correct 26 ms 1996 KB Output is correct
5 Correct 27 ms 1988 KB Output is correct

Subtask #6
0 / 9.0

# Verdict Execution time Memory Grader output
1 Runtime error 49 ms 6360 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 138 ms 4284 KB Output is correct
2 Runtime error 52 ms 6372 KB Execution killed with signal 6
3 Halted 0 ms 0 KB -

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 25 ms 1964 KB Output is correct
12 Correct 27 ms 1988 KB Output is correct
13 Correct 24 ms 1992 KB Output is correct
14 Correct 26 ms 1996 KB Output is correct
15 Correct 27 ms 1988 KB Output is correct
16 Correct 25 ms 1988 KB Output is correct
17 Correct 27 ms 1856 KB Output is correct
18 Correct 27 ms 1988 KB Output is correct
19 Correct 24 ms 1988 KB Output is correct
20 Correct 27 ms 2000 KB Output is correct
21 Correct 23 ms 2000 KB Output is correct
22 Correct 26 ms 1816 KB Output is correct
23 Correct 26 ms 1992 KB Output is correct
24 Correct 25 ms 1988 KB Output is correct
25 Correct 25 ms 1992 KB Output is correct

Subtask #9
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Runtime error 1 ms 604 KB Execution killed with signal 6
18 Halted 0 ms 0 KB -

Subtask #10
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Runtime error 1 ms 604 KB Execution killed with signal 6
18 Halted 0 ms 0 KB -