Submission #1145928

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1145928	2025-02-05 12:45:14	VMaksimoski008	Trampoline (info1cup20_trampoline)	C++20	100 / 100	741 ms	40308 KiB

trampoline

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
const int maxn = 2e5 + 5;
int up[maxn][20];
int lb(vector<pii> &V, pii x) {
    return lower_bound(V.begin(), V.end(), x) - V.begin();
}
int main() {
    int n, m, k; cin >> n >> m >> k;
    vector<int> x(k+2), y(k+2, m+5);
    for(int i=1; i<=k+1; i++)
        for(int j=0; j<20; j++) up[i][j] = k + 1;
    map<int, vector<pii> > mp;
    for(int i=1; i<=k; i++) {
        cin >> x[i] >> y[i];
        mp[x[i]].push_back({ y[i], i });
    }
    for(auto &[r, vec] : mp)
        sort(vec.begin(), vec.end());
    for(auto [r, vec] : mp) {
        for(auto [c, i] : vec) {
            int p = lb(mp[r+1], pii{ c, 0 });
            if(p != mp[r+1].size()) up[i][0] = mp[r+1][p].second;
        }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 23 / 23
• Subtask 2: 20 / 20
• Subtask 3: 11 / 11
• Subtask 4: 19 / 19
• Subtask 5: 27 / 27