Submission #1112749

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1112749	2024-11-14 18:30:31	PagodePaiva	Tropical Garden (IOI11_garden)	C++17	49 / 100	7 ms	4944 KiB

garden

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include<bits/stdc++.h>
#include "garden.h"
#include "gardenlib.h"
using namespace std;
const int N = 1010;
vector <array <int, 2>> g[N];
void count_routes(int n, int m, int P, int r[][2], int Q, int G[]){
  for(int i = 0;i < m;i++){
    g[r[i][0]].push_back({i, r[i][1]});
    g[r[i][1]].push_back({i, r[i][0]});
  }
  for(int i = 0;i < n;i++){
    sort(g[i].begin(), g[i].end());
  }
  for(int i =0;i < Q;i++){
    int res = 0;
    for(int j = 0;j < n;j++){
      int v = j, peso = -1;
      int k = G[i];
      while(k > 0){
        if(g[v].empty())k--;
        else{
          if(g[v][0][0] != peso){
            peso = g[v][0][0];
            v = g[v][0][1];
          }
          else{
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 49 / 49
• Subtask 2: 0 / 20
• Subtask 3: 0 / 31