oj.uz

답안 #778713

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
778713 2023-07-10T15:29:57 Z Ahmed57 Cats or Dogs (JOI18_catdog) C++17
38 / 100
 3000 ms 7212 KB 
#include "catdog.h"
 
#include <bits/stdc++.h>
 
using namespace std;
vector<int> adj[100001];
bool ss = 0;
void initialize(int N,vector<int> A,vector<int> B){
    if(N==1)ss = 1;
    for(int i = 0;i<N-1;i++){
        adj[A[i]].push_back(B[i]);
        adj[B[i]].push_back(A[i]);
    }
}
int R[100001],B[100001];
int col[100001];
void solve(int i,int pr){
    R[i] = 0;B[i] = 0;
    for(auto j:adj[i]){
        if(j==pr)continue;
        solve(j,i);
        R[i] += min(R[j],B[j]+1);
        B[i] += min(R[j]+1,B[j]);
    }
    if(col[i]==1){
        B[i] = 1e9;
    }if(col[i]==2){
        R[i] = 1e9;
    }
}
int cat(int v){
    if(ss)return 0;
    col[v] = 1;
    solve(1,0);
    return min(R[1],B[1]);
}int dog(int v){
    if(ss)return 0;
    col[v] = 2;
    solve(1,0);
    return min(R[1],B[1]);
}int neighbor(int v){
    if(ss)return 0;
    col[v] = 0;
    solve(1,0);
    return min(R[1],B[1]);
}/*
int main(){
    int N = 5;vector<int>A = {1,2,2,4};
    vector<int> BB = {2,3,4,5};
    initialize(N,A,BB);
    cout<<cat(3)<<endl;
    cout<<dog(5)<<endl;
    cout<<dog(1)<<endl;
    cout<<cat(2)<<endl;
    cout<<neighbor(2)<<endl;
}
*/

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 1 ms 2644 KB Output is correct
5 Correct 1 ms 2644 KB Output is correct
6 Correct 1 ms 2644 KB Output is correct
7 Correct 1 ms 2656 KB Output is correct
8 Correct 1 ms 2644 KB Output is correct
9 Correct 1 ms 2644 KB Output is correct
10 Correct 1 ms 2656 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 1 ms 2644 KB Output is correct
13 Correct 2 ms 2644 KB Output is correct
14 Correct 1 ms 2644 KB Output is correct
15 Correct 1 ms 2644 KB Output is correct
16 Correct 1 ms 2644 KB Output is correct

Subtask #2
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 1 ms 2644 KB Output is correct
5 Correct 1 ms 2644 KB Output is correct
6 Correct 1 ms 2644 KB Output is correct
7 Correct 1 ms 2656 KB Output is correct
8 Correct 1 ms 2644 KB Output is correct
9 Correct 1 ms 2644 KB Output is correct
10 Correct 1 ms 2656 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 1 ms 2644 KB Output is correct
13 Correct 2 ms 2644 KB Output is correct
14 Correct 1 ms 2644 KB Output is correct
15 Correct 1 ms 2644 KB Output is correct
16 Correct 1 ms 2644 KB Output is correct
17 Correct 6 ms 2668 KB Output is correct
18 Correct 8 ms 2664 KB Output is correct
19 Correct 5 ms 2716 KB Output is correct
20 Correct 1 ms 2644 KB Output is correct
21 Correct 2 ms 2644 KB Output is correct
22 Correct 3 ms 2644 KB Output is correct
23 Correct 9 ms 2724 KB Output is correct
24 Correct 7 ms 2716 KB Output is correct
25 Correct 4 ms 2656 KB Output is correct
26 Correct 2 ms 2660 KB Output is correct
27 Correct 2 ms 2644 KB Output is correct
28 Correct 3 ms 2644 KB Output is correct
29 Correct 10 ms 2772 KB Output is correct
30 Correct 2 ms 2652 KB Output is correct
31 Correct 2 ms 2644 KB Output is correct
32 Correct 4 ms 2660 KB Output is correct

Subtask #3
0 / 62.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 1 ms 2644 KB Output is correct
5 Correct 1 ms 2644 KB Output is correct
6 Correct 1 ms 2644 KB Output is correct
7 Correct 1 ms 2656 KB Output is correct
8 Correct 1 ms 2644 KB Output is correct
9 Correct 1 ms 2644 KB Output is correct
10 Correct 1 ms 2656 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 1 ms 2644 KB Output is correct
13 Correct 2 ms 2644 KB Output is correct
14 Correct 1 ms 2644 KB Output is correct
15 Correct 1 ms 2644 KB Output is correct
16 Correct 1 ms 2644 KB Output is correct
17 Correct 6 ms 2668 KB Output is correct
18 Correct 8 ms 2664 KB Output is correct
19 Correct 5 ms 2716 KB Output is correct
20 Correct 1 ms 2644 KB Output is correct
21 Correct 2 ms 2644 KB Output is correct
22 Correct 3 ms 2644 KB Output is correct
23 Correct 9 ms 2724 KB Output is correct
24 Correct 7 ms 2716 KB Output is correct
25 Correct 4 ms 2656 KB Output is correct
26 Correct 2 ms 2660 KB Output is correct
27 Correct 2 ms 2644 KB Output is correct
28 Correct 3 ms 2644 KB Output is correct
29 Correct 10 ms 2772 KB Output is correct
30 Correct 2 ms 2652 KB Output is correct
31 Correct 2 ms 2644 KB Output is correct
32 Correct 4 ms 2660 KB Output is correct
33 Execution timed out 3066 ms 7212 KB Time limit exceeded
34 Halted 0 ms 0 KB -