oj.uz

Submission #1026948

# Submission time Handle Problem Language Result Execution time Memory
1026948 2024-07-18T14:35:48 Z mindiyak Tropical Garden (IOI11_garden) C++14
49 / 100
 5000 ms 7004 KB 
#include "garden.h"
#include "gardenlib.h"
#pragma GCC optimize("O1,O2,O3,Ofast,unroll-loops")
#include <bits/stdc++.h>
#include <string>
#include <iostream>
#include <cmath>
#include <numeric>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<int, int> pl;
typedef pair<ld, ld> pd;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<vector<int>> vvi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
#define FOR(i, a, b) for (int i = a; i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define FORd(i, a, b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i, a) for (int i = (a)-1; i >= 0; i--)
#define trav(a, x) for (auto &a : x)
#define uid(a, b) uniform_int_distribution<int>(a, b)(rng)
#define len(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define F first
#define nl endl
#define S second
#define lb lower_bound
#define ub upper_bound
#define aint(x) x.begin(), x.end()
#define raint(x) x.rbegin(), x.rend()
#define ins insert
const int MOD = 1000000007;

vector<vpi> paths(150002,vpi());
int P;
int ans = 0;
int final_val = 0;

void dfs(int pos,int prev,int dis){
  if(dis>final_val)return;
  if(dis == final_val){
    if(pos == P)ans += 1;
    return;
  }

  if(paths[pos][0].S != prev || paths[pos].size() == 1){
    dfs(paths[pos][0].S,pos,dis+1);
    return;
  }
  dfs(paths[pos][1].S,pos,dis+1);
}

void count_routes(int N, int M, int P_, int R[][2], int Q, int G[])
{
  P = P_;
  FOR(i,0,M){
    paths[R[i][0]].pb({i,R[i][1]});
    paths[R[i][1]].pb({i,R[i][0]});
  }

  FOR(i,0,N){
    sort(paths[i].begin(),paths[i].end());
  }

  final_val = G[0];

  FOR(i,0,N){
    dfs(i,-1,0);
  }

  answer(ans);
}

Subtask #1
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3932 KB Output is correct
2 Correct 2 ms 3932 KB Output is correct
3 Correct 2 ms 3932 KB Output is correct
4 Correct 2 ms 3932 KB Output is correct
5 Correct 2 ms 3932 KB Output is correct
6 Correct 3 ms 3932 KB Output is correct
7 Correct 3 ms 3932 KB Output is correct
8 Correct 2 ms 3932 KB Output is correct
9 Correct 4 ms 4320 KB Output is correct

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3932 KB Output is correct
2 Correct 2 ms 3932 KB Output is correct
3 Correct 2 ms 3932 KB Output is correct
4 Correct 2 ms 3932 KB Output is correct
5 Correct 2 ms 3932 KB Output is correct
6 Correct 3 ms 3932 KB Output is correct
7 Correct 3 ms 3932 KB Output is correct
8 Correct 2 ms 3932 KB Output is correct
9 Correct 4 ms 4320 KB Output is correct
10 Correct 6 ms 3928 KB Output is correct
11 Execution timed out 5057 ms 7004 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #3
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3932 KB Output is correct
2 Correct 2 ms 3932 KB Output is correct
3 Correct 2 ms 3932 KB Output is correct
4 Correct 2 ms 3932 KB Output is correct
5 Correct 2 ms 3932 KB Output is correct
6 Correct 3 ms 3932 KB Output is correct
7 Correct 3 ms 3932 KB Output is correct
8 Correct 2 ms 3932 KB Output is correct
9 Correct 4 ms 4320 KB Output is correct
10 Correct 6 ms 3928 KB Output is correct
11 Execution timed out 5057 ms 7004 KB Time limit exceeded
12 Halted 0 ms 0 KB -