# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1145223 | Medetbek | Trampoline (info1cup20_trampoline) | C++20 | 487 ms | 1114112 KiB |
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimize("Ofast,unroll-loops,fast-math,O3")
#include <bits/stdc++.h>
#define ll long long
#define int long long
#define all(v) v.begin(), v.end()
#define nl '\n'
#define pb push_back
#define sz(s) (int)(s).size()
#define f first
#define s second
#define boost ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
using namespace std;
const ll N = 1e5+10, MX = 1e18+1, MOD = 1e9 + 7;
void solve(){
ll R, C, n;
cin >> R >> C >> n;
ll N = R, M = C;
ll a[N+1][M+1];
set <int> g[N+2];
for(int i = 1; i <= N; i++){
for(int j = 1; j <= M; j++){
a[i][j]=0;
}
}
for(int i = 1; i <= n; i++){
ll x, y;
cin >> x >> y;
Compilation message (stderr)
# | 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... |