Submission #1074171

#	Time	Username	Problem	Language	Result	Execution time	Memory
1074171		Malix	Tropical Garden (IOI11_garden)	C++14	49 / 100	145 ms	262144 KiB

garden

#include "garden.h"
#include "gardenlib.h"
#include <bits/stdc++.h>
using namespace std;

#define REP(a,b,c) for(int a=b;a<c;a++)
#define F first
#define S second
#define PB push_back

typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef pair<int,int> pi;

vii a,b,c;
int k=0;

void solve(int x){
  REP(i,1,k){
    int p=b[x][i-1];
    int q=b[x][i];
    if(a[q].size()==1){
      b[x][i+1]=a[q][0];
      continue;
    }
    if(a[q].front()==p){
      b[x][i+1]=a[q][1];
      continue;
    }
    else{
      b[x][i+1]=a[q][0];
      continue;
    }
  }
}

void count_routes(int n, int m, int P, int R[][2], int Q, int G[])
{
  a.resize(n);
  REP(i,0,m){
    int x=R[i][0];
    int y=R[i][1];
    a[x].PB(y);
    a[y].PB(x);
  }
  b.resize(n,vi(G[0]+1));
  k=G[0];
  REP(i,0,n){
    b[i][0]=i;
    b[i][1]=a[i].front();
  }
  REP(i,0,n)solve(i);
  int ans=0;
  REP(i,0,n)if(b[i][G[0]]==P)ans++;
  answer(ans);
}

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