| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 347845 | tengiz05 | Tropical Garden (IOI11_garden) | C++17 | 5049 ms | 44908 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 "garden.h"
#include "gardenlib.h"
//~ #include "grader.cpp"
#include <bits/stdc++.h>
using namespace std;
#define pii pair<int,int>
#define pb push_back
const int N_ = 150005;
int ans, n, m, target;
vector<int> edges[N_];
int d;
int nxt[N_*2][30];
void count_routes(int N, int M, int P, int R[][2], int Q, int G[]){
target = P;
n = N, m = M;
for(int i=0;i<m;i++){
if(edges[R[i][0]].size() < 2)edges[R[i][0]].pb(R[i][1]);
if(edges[R[i][1]].size() < 2)edges[R[i][1]].pb(R[i][0]);
}
for(int i=0;i<n*2;i++){
nxt[i][0] = -1;
}
for(int i=0;i<n;i++){
for(int j=0;j<(int)edges[i].size();j++){
int to = edges[i][j];
if(edges[to][0] == i && edges[to].size() == 2){
nxt[i+j*n][0] = to+n;
}else {
nxt[i+j*n][0] = to;
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||