# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
521095 | Lam_lai_cuoc_doi | Race (IOI11_race) | C++17 | 376 ms | 78284 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 <iostream>
#include <cstdio>
#include <map>
#include <functional>
#include <vector>
//#include "race.h"
using namespace std;
using ll = long long;
using ld = long double;
constexpr int N = 2e5 + 5;
constexpr int Inf = 1e9 + 7;
ll d[N];
vector<pair<int, int>> adj[N];
map<ll, int> cnt[N];
int ranks[N];
int Get(map<ll, int> &cnt, ll x)
{
auto j = cnt.find(x);
return j == cnt.end() ? Inf * 2 : j->second;
}
void Update(map<ll, int> &cnt, ll x, int y)
{
auto j = cnt.find(x);
if (j == cnt.end())
cnt[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... |