oj.uz

답안 #115361

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
115361 2019-06-07T02:54:51 Z Runtime_error_ 열대 식물원 (Tropical Garden) (IOI11_garden) C++14
49 / 100
 48 ms 1492 KB 
//IOI 2011 Day 1 Problem 1 Garden
// First subtask solution 49 points
#include "garden.h"//for CMS
#include "gardenlib.h"//for CMS

//#include "grader.h" // for Yandex
#include <bits/stdc++.h>
using namespace std;
const int inf=1e3+9;
int ans=0,target;
vector<pair<int,int> > v[inf];

void dfs(int node,int left,int par){

    if(left==0 ){
        ans+=(node==target);
        return ;
    }

    pair<int,int >  temp[4];
    temp[1]=temp[2]=temp[0]=make_pair(1e9,1e9);

    for(auto o:v[node])
        temp[2]=o,sort(temp,temp+3);

    if(temp[0].second!=par || temp[1].second>=1e9)
        dfs(temp[0].second,left-1,node);
    else
        dfs(temp[1].second,left-1,node);
}

void count_routes(int N, int M, int P, int R[][2], int Q, int G[])
{

    for(int i=0;i<M;i++)
        v[R[i][0]].push_back(make_pair(i,R[i][1])),
        v[R[i][1]].push_back(make_pair(i,R[i][0]) );

    target=P;
    for(int i=0;i<N;i++)
       dfs(i,G[0],-1);

    answer(ans);
}

Subtask #1
49.0 / 49.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 348 KB Output is correct
2 Correct 6 ms 376 KB Output is correct
3 Correct 6 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 7 ms 376 KB Output is correct
7 Correct 4 ms 420 KB Output is correct
8 Correct 11 ms 376 KB Output is correct
9 Correct 36 ms 712 KB Output is correct

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 348 KB Output is correct
2 Correct 6 ms 376 KB Output is correct
3 Correct 6 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 7 ms 376 KB Output is correct
7 Correct 4 ms 420 KB Output is correct
8 Correct 11 ms 376 KB Output is correct
9 Correct 36 ms 712 KB Output is correct
10 Correct 48 ms 1492 KB Output is correct
11 Runtime error 8 ms 1012 KB Execution killed with signal 11 (could be triggered by violating memory limits)
12 Halted 0 ms 0 KB -

Subtask #3
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 348 KB Output is correct
2 Correct 6 ms 376 KB Output is correct
3 Correct 6 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 7 ms 376 KB Output is correct
7 Correct 4 ms 420 KB Output is correct
8 Correct 11 ms 376 KB Output is correct
9 Correct 36 ms 712 KB Output is correct
10 Correct 48 ms 1492 KB Output is correct
11 Runtime error 8 ms 1012 KB Execution killed with signal 11 (could be triggered by violating memory limits)
12 Halted 0 ms 0 KB -