oj.uz

Submission #924248

# Submission time Handle Problem Language Result Execution time Memory
924248 2024-02-08T17:04:39 Z raysh07 Pilot (NOI19_pilot) C++17
89 / 100
 1000 ms 87644 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define INF (int)1e18
#define f first
#define s second
const int N=2e5+69;
int ans=0;
mt19937_64 RNG(chrono::steady_clock::now().time_since_epoch().count());


class DisjointSets {
  private:
    vector<int> parents;
    vector<int> sizes;

  public:
    DisjointSets(int size) : parents(size), sizes(size, 1) {
        for (int i = 0; i < size; i++) { parents[i] = i; }
    }

    /** @return the "representative" node in x's component */
    int find(int x) {
        return parents[x] == x ? x : (parents[x] = find(parents[x]));
    }

    /** @return whether the merge changed connectivity */
    bool unite(int x, int y) {
        int x_root = find(x);
        int y_root = find(y);
        if (x_root == y_root) 
            { return false;
            }

        ans+=sizes[x_root]*sizes[y_root];
        if (sizes[x_root] < sizes[y_root]) { swap(x_root, y_root); }
        sizes[x_root] += sizes[y_root];
        parents[y_root] = x_root;
        return true;
    }

    /** @return whether x and y are in the same connected component */
    bool connected(int x, int y) { return find(x) == find(y); }
};

void Solve(){
    int n,q;
    cin>>n>>q;
    int H[n];
    int A[q];
    const int N = 1e6 + 1;
    vector <int> mp(N, 0);
    for(int i=0;i<n;i++)
        cin>>H[i];
    
    for(int i=0;i<q;i++)
        cin>>A[i];

    vector <pair<int,int>> vec;
    
    for(int i=0;i<n;i++)
        vec.push_back({H[i],i});
    DisjointSets ds(n);
    
    sort(vec.begin(),vec.end());
    set <int> st;
    int cnt = 0;
    for(auto [x,i]: vec){
        if(i!=0&&H[i-1]<=H[i]){
            ds.unite(i-1,i); 
        }
        if(i!=n-1 && H[i+1]<=H[i])
            ds.unite(i,i+1); 
        cnt++;
        mp[x]=ans + cnt; 
        st.insert(x);
    }
    
    for(int i=0;i<q;i++){
        // we need to find the largest number <= x 
        auto it = st.upper_bound(A[i]);
        // this finds the first place with a number > x 
        // --it 
        if (it == st.begin()){
            cout << 0 << "\n";
        } else {
            --it;
            cout << mp[*it] << "\n";
        }
    }
}
int32_t main() 
{
    auto begin = std::chrono::high_resolution_clock::now();
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int t = 1;
    // freopen("in",  "r", stdin);
    // freopen("out", "w", stdout);
    
    //cin >> t;
    for(int i = 1; i <= t; i++) 
    {
        //cout << "Case #" << i << ": ";
        Solve();
    }
    auto end = std::chrono::high_resolution_clock::now();
    auto elapsed = std::chrono::duration_cast<std::chrono::nanoseconds>(end - begin);
    cerr << "Time measured: " << elapsed.count() * 1e-9 << " seconds.\n"; 
    return 0;
}

Subtask #1
3.0 / 3.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8280 KB Output is correct
2 Correct 2 ms 8284 KB Output is correct
3 Correct 2 ms 8284 KB Output is correct
4 Correct 2 ms 8284 KB Output is correct
5 Correct 2 ms 8284 KB Output is correct
6 Correct 2 ms 8232 KB Output is correct
7 Correct 2 ms 8284 KB Output is correct
8 Correct 2 ms 8284 KB Output is correct
9 Correct 2 ms 8284 KB Output is correct
10 Correct 2 ms 8284 KB Output is correct
11 Correct 2 ms 8280 KB Output is correct
12 Correct 2 ms 8280 KB Output is correct
13 Correct 2 ms 8284 KB Output is correct
14 Correct 2 ms 8284 KB Output is correct
15 Correct 2 ms 8284 KB Output is correct
16 Correct 2 ms 8284 KB Output is correct
17 Correct 3 ms 8284 KB Output is correct
18 Correct 2 ms 8284 KB Output is correct
19 Correct 2 ms 8284 KB Output is correct
20 Correct 2 ms 8284 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8280 KB Output is correct
2 Correct 2 ms 8284 KB Output is correct
3 Correct 2 ms 8284 KB Output is correct
4 Correct 2 ms 8284 KB Output is correct
5 Correct 2 ms 8284 KB Output is correct
6 Correct 2 ms 8232 KB Output is correct
7 Correct 2 ms 8284 KB Output is correct
8 Correct 2 ms 8284 KB Output is correct
9 Correct 2 ms 8284 KB Output is correct
10 Correct 2 ms 8284 KB Output is correct
11 Correct 2 ms 8280 KB Output is correct
12 Correct 2 ms 8280 KB Output is correct
13 Correct 2 ms 8284 KB Output is correct
14 Correct 2 ms 8284 KB Output is correct
15 Correct 2 ms 8284 KB Output is correct
16 Correct 2 ms 8284 KB Output is correct
17 Correct 3 ms 8284 KB Output is correct
18 Correct 2 ms 8284 KB Output is correct
19 Correct 2 ms 8284 KB Output is correct
20 Correct 2 ms 8284 KB Output is correct
21 Correct 3 ms 8284 KB Output is correct
22 Correct 2 ms 8284 KB Output is correct
23 Correct 2 ms 8284 KB Output is correct
24 Correct 2 ms 8284 KB Output is correct
25 Correct 2 ms 8284 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 15172 KB Output is correct
2 Correct 41 ms 16328 KB Output is correct
3 Correct 35 ms 14536 KB Output is correct
4 Correct 32 ms 15656 KB Output is correct
5 Correct 31 ms 14548 KB Output is correct

Subtask #6
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 17816 KB Output is correct
2 Correct 52 ms 18000 KB Output is correct
3 Correct 52 ms 17744 KB Output is correct
4 Correct 53 ms 18124 KB Output is correct
5 Correct 52 ms 17612 KB Output is correct

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 62 ms 18152 KB Output is correct
2 Correct 61 ms 17864 KB Output is correct
3 Correct 62 ms 17608 KB Output is correct
4 Correct 62 ms 18376 KB Output is correct
5 Correct 64 ms 17952 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8280 KB Output is correct
2 Correct 2 ms 8284 KB Output is correct
3 Correct 2 ms 8284 KB Output is correct
4 Correct 2 ms 8284 KB Output is correct
5 Correct 2 ms 8284 KB Output is correct
6 Correct 2 ms 8232 KB Output is correct
7 Correct 2 ms 8284 KB Output is correct
8 Correct 2 ms 8284 KB Output is correct
9 Correct 2 ms 8284 KB Output is correct
10 Correct 2 ms 8284 KB Output is correct
11 Correct 32 ms 15172 KB Output is correct
12 Correct 41 ms 16328 KB Output is correct
13 Correct 35 ms 14536 KB Output is correct
14 Correct 32 ms 15656 KB Output is correct
15 Correct 31 ms 14548 KB Output is correct
16 Correct 30 ms 14548 KB Output is correct
17 Correct 35 ms 16484 KB Output is correct
18 Correct 35 ms 16588 KB Output is correct
19 Correct 31 ms 14536 KB Output is correct
20 Correct 34 ms 16592 KB Output is correct
21 Correct 31 ms 14540 KB Output is correct
22 Correct 33 ms 15820 KB Output is correct
23 Correct 37 ms 15088 KB Output is correct
24 Correct 31 ms 15892 KB Output is correct
25 Correct 32 ms 14804 KB Output is correct

Subtask #9
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8280 KB Output is correct
2 Correct 2 ms 8284 KB Output is correct
3 Correct 2 ms 8284 KB Output is correct
4 Correct 2 ms 8284 KB Output is correct
5 Correct 2 ms 8284 KB Output is correct
6 Correct 2 ms 8232 KB Output is correct
7 Correct 2 ms 8284 KB Output is correct
8 Correct 2 ms 8284 KB Output is correct
9 Correct 2 ms 8284 KB Output is correct
10 Correct 2 ms 8284 KB Output is correct
11 Correct 2 ms 8280 KB Output is correct
12 Correct 2 ms 8280 KB Output is correct
13 Correct 2 ms 8284 KB Output is correct
14 Correct 2 ms 8284 KB Output is correct
15 Correct 2 ms 8284 KB Output is correct
16 Correct 2 ms 8284 KB Output is correct
17 Correct 3 ms 8284 KB Output is correct
18 Correct 2 ms 8284 KB Output is correct
19 Correct 2 ms 8284 KB Output is correct
20 Correct 2 ms 8284 KB Output is correct
21 Correct 3 ms 8284 KB Output is correct
22 Correct 2 ms 8284 KB Output is correct
23 Correct 2 ms 8284 KB Output is correct
24 Correct 2 ms 8284 KB Output is correct
25 Correct 2 ms 8284 KB Output is correct
26 Correct 32 ms 15172 KB Output is correct
27 Correct 41 ms 16328 KB Output is correct
28 Correct 35 ms 14536 KB Output is correct
29 Correct 32 ms 15656 KB Output is correct
30 Correct 31 ms 14548 KB Output is correct
31 Correct 53 ms 17816 KB Output is correct
32 Correct 52 ms 18000 KB Output is correct
33 Correct 52 ms 17744 KB Output is correct
34 Correct 53 ms 18124 KB Output is correct
35 Correct 52 ms 17612 KB Output is correct
36 Correct 62 ms 18152 KB Output is correct
37 Correct 61 ms 17864 KB Output is correct
38 Correct 62 ms 17608 KB Output is correct
39 Correct 62 ms 18376 KB Output is correct
40 Correct 64 ms 17952 KB Output is correct
41 Correct 30 ms 14548 KB Output is correct
42 Correct 35 ms 16484 KB Output is correct
43 Correct 35 ms 16588 KB Output is correct
44 Correct 31 ms 14536 KB Output is correct
45 Correct 34 ms 16592 KB Output is correct
46 Correct 31 ms 14540 KB Output is correct
47 Correct 33 ms 15820 KB Output is correct
48 Correct 37 ms 15088 KB Output is correct
49 Correct 31 ms 15892 KB Output is correct
50 Correct 32 ms 14804 KB Output is correct
51 Correct 58 ms 16328 KB Output is correct
52 Correct 70 ms 17352 KB Output is correct
53 Correct 57 ms 16408 KB Output is correct
54 Correct 69 ms 17352 KB Output is correct
55 Correct 58 ms 16720 KB Output is correct

Subtask #10
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8280 KB Output is correct
2 Correct 2 ms 8284 KB Output is correct
3 Correct 2 ms 8284 KB Output is correct
4 Correct 2 ms 8284 KB Output is correct
5 Correct 2 ms 8284 KB Output is correct
6 Correct 2 ms 8232 KB Output is correct
7 Correct 2 ms 8284 KB Output is correct
8 Correct 2 ms 8284 KB Output is correct
9 Correct 2 ms 8284 KB Output is correct
10 Correct 2 ms 8284 KB Output is correct
11 Correct 2 ms 8280 KB Output is correct
12 Correct 2 ms 8280 KB Output is correct
13 Correct 2 ms 8284 KB Output is correct
14 Correct 2 ms 8284 KB Output is correct
15 Correct 2 ms 8284 KB Output is correct
16 Correct 2 ms 8284 KB Output is correct
17 Correct 3 ms 8284 KB Output is correct
18 Correct 2 ms 8284 KB Output is correct
19 Correct 2 ms 8284 KB Output is correct
20 Correct 2 ms 8284 KB Output is correct
21 Correct 3 ms 8284 KB Output is correct
22 Correct 2 ms 8284 KB Output is correct
23 Correct 2 ms 8284 KB Output is correct
24 Correct 2 ms 8284 KB Output is correct
25 Correct 2 ms 8284 KB Output is correct
26 Correct 32 ms 15172 KB Output is correct
27 Correct 41 ms 16328 KB Output is correct
28 Correct 35 ms 14536 KB Output is correct
29 Correct 32 ms 15656 KB Output is correct
30 Correct 31 ms 14548 KB Output is correct
31 Correct 53 ms 17816 KB Output is correct
32 Correct 52 ms 18000 KB Output is correct
33 Correct 52 ms 17744 KB Output is correct
34 Correct 53 ms 18124 KB Output is correct
35 Correct 52 ms 17612 KB Output is correct
36 Correct 62 ms 18152 KB Output is correct
37 Correct 61 ms 17864 KB Output is correct
38 Correct 62 ms 17608 KB Output is correct
39 Correct 62 ms 18376 KB Output is correct
40 Correct 64 ms 17952 KB Output is correct
41 Correct 30 ms 14548 KB Output is correct
42 Correct 35 ms 16484 KB Output is correct
43 Correct 35 ms 16588 KB Output is correct
44 Correct 31 ms 14536 KB Output is correct
45 Correct 34 ms 16592 KB Output is correct
46 Correct 31 ms 14540 KB Output is correct
47 Correct 33 ms 15820 KB Output is correct
48 Correct 37 ms 15088 KB Output is correct
49 Correct 31 ms 15892 KB Output is correct
50 Correct 32 ms 14804 KB Output is correct
51 Correct 58 ms 16328 KB Output is correct
52 Correct 70 ms 17352 KB Output is correct
53 Correct 57 ms 16408 KB Output is correct
54 Correct 69 ms 17352 KB Output is correct
55 Correct 58 ms 16720 KB Output is correct
56 Execution timed out 1073 ms 87644 KB Time limit exceeded
57 Halted 0 ms 0 KB -