# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1089882 | KALARRY | Tricks of the Trade (CEOI23_trade) | C++14 | 1409 ms | 2097152 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.
//chockolateman
#include<bits/stdc++.h>
using namespace std;
long long N,K,a[250005],b[250005],dp[250005][205];
vector<pair<int,int>> adj[250005][205];
bool visited[250005][205];
bool used[250005];
void dfs(int startv,int startj)
{
queue<pair<int,int>> q;
q.push({startv,startj});
while(!q.empty())
{
int v = q.front().first;
int j = q.front().second;
if(visited[v][j])
return;
visited[v][j] = true;
if(j==0)
return;
for(auto e : adj[v][j])
{
int u = e.first;
int newj = e.second;
if(newj==(j-1))
used[v] = true;
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |