oj.uz

답안 #1113953

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1113953 2024-11-17T22:23:58 Z lucascgar 열대 식물원 (Tropical Garden) (IOI11_garden) C++17
100 / 100
 801 ms 20296 KB 
#include "garden.h"
#include "gardenlib.h"
#include <bits/stdc++.h>

using namespace std;

/*
só interessam as duas arestas mais valiosas de um cara
ou vc ta em um ciclo ou vc escoa um ciclo

*/

typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef pair<long double, long double> pdd;

const int MAXN = 150000+10, MAXQ = 2e3+10, BIG = 1e9+1;

vector<pii> e[MAXN];

int ds[MAXN][2];  // distância até p
bool st[MAXN][2];  // o estado que pega p


bool dfs(int x, int l, int P){
    bool cr = 0;
    if (e[x].size() > 1 && l == e[x][0].second) cr=1;

    if (ds[x][cr] != BIG) return cr;
    ds[x][cr] = -1;

    auto i = e[x][cr].first;
    if (i == P){
        ds[x][cr] = 1, st[x][cr] = (e[i].size()>1 && e[x][cr].second==e[i][0].second);
        return cr;
    }

    bool is = dfs(i, e[x][cr].second, P);

    if (ds[i][is] != -1){
        ds[x][cr] = ds[i][is]+1;
        st[x][cr] = st[i][is];
    }

    return cr;

}

void count_routes(int n, int m, int P, int R[][2], int q, int G[]){

    for (int i=0;i<n;i++){
        e[i].clear();
        ds[i][0] = ds[i][1] = BIG;
    }

    for (int i=0;i<m;i++){
        int a = R[i][0], b = R[i][1];
        if (e[a].size()<2) e[a].emplace_back(b, i);
        if (e[b].size()<2) e[b].emplace_back(a, i);
    }

    for (int i=0;i<n;i++){
        if (ds[i][0] == BIG) dfs(i, -1, P);
    }

    dfs(P, e[P][0].second, P);
    // for (int i=0;i<n;i++) cerr << ds[i][0] << ' ' << ds[i][1] << '\n';

    for (int _=0;_<q;_++){
        int sk = G[_], cr = 0;

        for (int i=0;i<n;i++) if (ds[i][0] != -1 && ds[i][0]<=sk){
            int k = sk;
            long long d = ds[i][0];
            if (d==k){
                cr++;
                // cerr << i << " can\n";
                continue;
            }
            k-=d;
            bool cst = st[i][0];
            if (ds[P][cst] == -1) continue;

            long long fcy = ds[P][cst];
            k -= fcy;
            if (k<=0){
                cr+=(k==0);
                continue;
            }
            bool nst = st[P][cst];

            if (nst == cst){
                cr += (k%fcy == 0);
                continue;
            }

            long long scy = ds[P][nst];
            bool tst = st[P][nst];
            k -= scy;
            if (k<=0){
                cr += (k==0);
                continue;
            }

            if (tst == nst){  // 1->2->2, ciclo simples
                cr += (k%scy == 0);
                continue;                
            }else{  // 1->2->1

                // small = fcy, big = scy
                long long rst = k%(fcy+scy);
                if (rst==0 || rst==fcy) cr++;

                continue;

            }
        }

        answer(cr);
        // cout << cr << '\n';

    }

}

Subtask #1
49.0 / 49.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 6480 KB Output is correct
2 Correct 2 ms 6480 KB Output is correct
3 Correct 2 ms 6696 KB Output is correct
4 Correct 2 ms 6480 KB Output is correct
5 Correct 3 ms 6480 KB Output is correct
6 Correct 2 ms 6480 KB Output is correct
7 Correct 2 ms 6480 KB Output is correct
8 Correct 2 ms 6480 KB Output is correct
9 Correct 3 ms 6580 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 6480 KB Output is correct
2 Correct 2 ms 6480 KB Output is correct
3 Correct 2 ms 6696 KB Output is correct
4 Correct 2 ms 6480 KB Output is correct
5 Correct 3 ms 6480 KB Output is correct
6 Correct 2 ms 6480 KB Output is correct
7 Correct 2 ms 6480 KB Output is correct
8 Correct 2 ms 6480 KB Output is correct
9 Correct 3 ms 6580 KB Output is correct
10 Correct 2 ms 6652 KB Output is correct
11 Correct 6 ms 7504 KB Output is correct
12 Correct 13 ms 8016 KB Output is correct
13 Correct 26 ms 15392 KB Output is correct
14 Correct 33 ms 12624 KB Output is correct
15 Correct 36 ms 11044 KB Output is correct
16 Correct 31 ms 9800 KB Output is correct
17 Correct 31 ms 10016 KB Output is correct
18 Correct 14 ms 8272 KB Output is correct
19 Correct 35 ms 12624 KB Output is correct
20 Correct 39 ms 12616 KB Output is correct
21 Correct 31 ms 9800 KB Output is correct
22 Correct 30 ms 10456 KB Output is correct
23 Correct 41 ms 12616 KB Output is correct

Subtask #3
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 6480 KB Output is correct
2 Correct 2 ms 6480 KB Output is correct
3 Correct 2 ms 6696 KB Output is correct
4 Correct 2 ms 6480 KB Output is correct
5 Correct 3 ms 6480 KB Output is correct
6 Correct 2 ms 6480 KB Output is correct
7 Correct 2 ms 6480 KB Output is correct
8 Correct 2 ms 6480 KB Output is correct
9 Correct 3 ms 6580 KB Output is correct
10 Correct 2 ms 6652 KB Output is correct
11 Correct 6 ms 7504 KB Output is correct
12 Correct 13 ms 8016 KB Output is correct
13 Correct 26 ms 15392 KB Output is correct
14 Correct 33 ms 12624 KB Output is correct
15 Correct 36 ms 11044 KB Output is correct
16 Correct 31 ms 9800 KB Output is correct
17 Correct 31 ms 10016 KB Output is correct
18 Correct 14 ms 8272 KB Output is correct
19 Correct 35 ms 12624 KB Output is correct
20 Correct 39 ms 12616 KB Output is correct
21 Correct 31 ms 9800 KB Output is correct
22 Correct 30 ms 10456 KB Output is correct
23 Correct 41 ms 12616 KB Output is correct
24 Correct 3 ms 6480 KB Output is correct
25 Correct 48 ms 7760 KB Output is correct
26 Correct 75 ms 8544 KB Output is correct
27 Correct 469 ms 15592 KB Output is correct
28 Correct 639 ms 12676 KB Output is correct
29 Correct 678 ms 12792 KB Output is correct
30 Correct 491 ms 11384 KB Output is correct
31 Correct 414 ms 10576 KB Output is correct
32 Correct 89 ms 8448 KB Output is correct
33 Correct 635 ms 12624 KB Output is correct
34 Correct 681 ms 12796 KB Output is correct
35 Correct 467 ms 11336 KB Output is correct
36 Correct 801 ms 10696 KB Output is correct
37 Correct 446 ms 12104 KB Output is correct
38 Correct 755 ms 20296 KB Output is correct