# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
346800 | arnold518 | Trampoline (info1cup20_trampoline) | C++14 | 788 ms | 55476 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int MAXN = 2e5;
int R, C, N, Q;
pii A[MAXN+10];
unordered_map<int, vector<pii>> M;
int par[MAXN+10][30];
int main()
{
scanf("%d%d%d", &R, &C, &N);
for(int i=1; i<=N; i++)
{
scanf("%d%d", &A[i].first, &A[i].second);
M[A[i].first].push_back({A[i].second, i});
}
for(auto &it : M)
{
sort(it.second.begin(), it.second.end());
}
for(int i=1; i<=N; i++)
{
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... |