oj.uz

Submission #122634

# Submission time Handle Problem Language Result Execution time Memory
122634 2019-06-28T20:40:12 Z CaroLinda Tropical Garden (IOI11_garden) C++14
49 / 100
 53 ms 11000 KB 
#include <bits/stdc++.h>
#include "gardenlib.h"
#include "garden.h"

#define lp(i,a,b) for(int i=a;i<b;i++)
#define pii pair<int,int>
#define ff first
#define ss second

const int MAXN = 15e4+10;
const int MAXM = 15e4+10 ;
const int MAXQ = 2005 ;
const int inf=1e9+10 ;

using namespace std;

int p ;
pii best[MAXN], secBest[MAXN] , dp[MAXN][2] ;

void inc(int i, int j)
{
    if(dp[i][j].ss != -1)
    dp[i][j].ff ++ ;
}

pii calcDp(int i, int j)
{
  if(i==p) return pii(0,j) ;

  if(dp[i][j].ff == -2 ) return dp[i][j]= pii(inf,-1) ;

  if(dp[i][j].ff!=-1) return dp[i][j] ;

  dp[i][j].ff = -2;

  if(j==0)
    dp[i][j] = calcDp(best[i].ff, best[i].ss) ;

  else dp[i][j] = calcDp(secBest[i].ff, secBest[i].ss) ;

  inc(i,j) ;

  return dp[i][j] ;

}

void count_routes(int n , int m , int P, int r[][2] , int q, int g[])
{
  p=P ;

lp(i,0,MAXN)
  best[i] = secBest[i] = pii(-1,0) ;
lp(i,0,MAXN)
lp(j,0,2) dp[i][j] = pii(-1,-1) ;

lp(i,0,m)
  lp(j,0,2)
  {
    int a = r[i][j] , b = r[i][!j] ;
    if(best[a].ff == -1){
      best[a].ff = b ;
      if( best[b].ff == -1 || best[b].ff == a )
        best[a].ss = 1 ;
    }
    else if(secBest[a].ff == -1)
    {
      secBest[a].ff = b ;
      if( best[b].ff == -1 || best[b].ff == a )
        secBest[a].ss = 1 ;
    }
  }

lp(i,0,n)
  if(secBest[i].ff == -1)
    secBest[i] = best[i] ;

 lp(i,0,n)
  lp(j,0,2)
    if(dp[i][j].ff == -1 && best[i].ff != -1 )
      dp[i][j] = calcDp(i,j) ;

dp[p][0] = calcDp(best[p].ff, best[p].ss) ;
inc(p,0) ;
dp[p][1] = calcDp(secBest[p].ff, secBest[p].ss) ;
inc(p,1) ;

int dist[3] = {dp[p][0].ff , dp[p][1].ff , dp[p][0].ff+dp[p][1].ff} ;
int edge[2] = {dp[p][0].ss , dp[p][1].ss} ;

lp(i,0,q)
{
    int ans = 0 ;
    lp(j,0,n)
    {
        int k = dp[j][0].ss , temp=dp[j][0].ff;
        if(k == -1) continue ;

        int forNow = g[i] - temp ;

        if(forNow == 0) ans ++ ;
        if(forNow<=0 || edge[k]==-1) continue ;

        if(edge[k] == k && forNow%dist[k] == 0) ans++ ;

        else
        {

            if(edge[!k] == !k && forNow-dist[k] >= 0)
                {if((forNow-dist[k])%dist[!k] == 0) ans ++ ;}

            else if(edge[!k] == k )
            {
                if( forNow%(dist[2]) == 0 ) ans ++ ;
                else if(forNow>=dist[k] && (forNow-dist[k])%(dist[2])==0) ans++ ;
            }
        }
    }
    answer(ans) ;
}

}

Subtask #1
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 5112 KB Output is correct
2 Correct 7 ms 4984 KB Output is correct
3 Correct 6 ms 4984 KB Output is correct
4 Correct 6 ms 5084 KB Output is correct
5 Correct 7 ms 4984 KB Output is correct
6 Correct 7 ms 5116 KB Output is correct
7 Correct 6 ms 5112 KB Output is correct
8 Correct 6 ms 5112 KB Output is correct
9 Correct 8 ms 5112 KB Output is correct

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 5112 KB Output is correct
2 Correct 7 ms 4984 KB Output is correct
3 Correct 6 ms 4984 KB Output is correct
4 Correct 6 ms 5084 KB Output is correct
5 Correct 7 ms 4984 KB Output is correct
6 Correct 7 ms 5116 KB Output is correct
7 Correct 6 ms 5112 KB Output is correct
8 Correct 6 ms 5112 KB Output is correct
9 Correct 8 ms 5112 KB Output is correct
10 Correct 6 ms 5112 KB Output is correct
11 Correct 12 ms 5468 KB Output is correct
12 Correct 22 ms 5540 KB Output is correct
13 Correct 32 ms 11000 KB Output is correct
14 Correct 50 ms 6140 KB Output is correct
15 Correct 53 ms 6200 KB Output is correct
16 Correct 47 ms 6136 KB Output is correct
17 Incorrect 46 ms 6136 KB Output isn't correct
18 Halted 0 ms 0 KB -

Subtask #3
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 5112 KB Output is correct
2 Correct 7 ms 4984 KB Output is correct
3 Correct 6 ms 4984 KB Output is correct
4 Correct 6 ms 5084 KB Output is correct
5 Correct 7 ms 4984 KB Output is correct
6 Correct 7 ms 5116 KB Output is correct
7 Correct 6 ms 5112 KB Output is correct
8 Correct 6 ms 5112 KB Output is correct
9 Correct 8 ms 5112 KB Output is correct
10 Correct 6 ms 5112 KB Output is correct
11 Correct 12 ms 5468 KB Output is correct
12 Correct 22 ms 5540 KB Output is correct
13 Correct 32 ms 11000 KB Output is correct
14 Correct 50 ms 6140 KB Output is correct
15 Correct 53 ms 6200 KB Output is correct
16 Correct 47 ms 6136 KB Output is correct
17 Incorrect 46 ms 6136 KB Output isn't correct
18 Halted 0 ms 0 KB -