# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1137846 | nikolashami | Trampoline (info1cup20_trampoline) | C++20 | 1291 ms | 68660 KiB |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
const int mod=1e9+7,T=69420;
struct ah{size_t operator()(const array<int,2>&a)const{return (int)((ll)a[0]*T+(ll)a[1])%mod;}};
int R,C,n,t;
unordered_map<int,set<int>>rw;
unordered_map<array<int,2>,int,ah>hsh;
vector<array<int,2>>zel;
set<array<int,2>>ss;
const int N=(1<<18)+22;
array<int,2>dehsh[N];
int go[N][19];
signed main(){
ios::sync_with_stdio(0);
cin.tie(0);
cin>>R>>C>>n;
for(int i=0;i<n;++i){
int x,y;
cin>>x>>y;
rw[x].insert(y);
ss.insert({x,y});
zel.push_back({x,y});
}
# | 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... |