# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1145306 | Muhammet | Trampoline (info1cup20_trampoline) | C++20 | 1322 ms | 68452 KiB |
#include "bits/stdc++.h"
using namespace std;
#define SZ(s) (int)s.size()
#define ff first
const int N = 2e5 + 5;
int c, r, n, x[N], y[N], sp[N][25];
map <int,int> mp;
map <pair<int,int>, int> ind;
map <int, pair<int,int>> ind1;
int main(){
ios::sync_with_stdio(false); cin.tie(nullptr);
cin >> r >> c >> n;
vector <int> v;
for(int i = 1; i <= n; i++){
cin >> x[i] >> y[i];
ind[{x[i], y[i]}] = i;
ind1[i] = {x[i], y[i]};
if(mp.find(x[i]) == mp.end()){
mp[x[i]] = 1;
v.push_back(x[i]);
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |