oj.uz

답안 #475226

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
475226 2021-09-21T14:39:46 Z NhatMinh0208 Cats or Dogs (JOI18_catdog) C++14
38 / 100
 3000 ms 7464 KB 
#ifndef CPL_TEMPLATE
#define CPL_TEMPLATE
/*
	Normie's Template v2.5
	Changes:
    Added warning against using pragmas on USACO.
*/
// Standard library in one include.
#include <bits/stdc++.h>
using namespace std;
 
// ordered_set library.
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set(el) tree<el,null_type,less<el>,rb_tree_tag,tree_order_statistics_node_update>
 
// AtCoder library. (Comment out these two lines if you're not submitting in AtCoder.) (Or if you want to use it in other judges, run expander.py first.)
//#include <atcoder/all>
//using namespace atcoder;

//Pragmas (Comment out these three lines if you're submitting in szkopul or USACO.)
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast,unroll-loops,tree-vectorize")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
 
//File I/O.
#define FILE_IN "cseq.inp"
#define FILE_OUT "cseq.out"
#define ofile freopen(FILE_IN,"r",stdin);freopen(FILE_OUT,"w",stdout)
 
//Fast I/O.
#define fio ios::sync_with_stdio(0);cin.tie(0)
#define nfio cin.tie(0)
#define endl "\n"
 
//Order checking.
#define ord(a,b,c) ((a>=b)and(b>=c))
 
//min/max redefines, so i dont have to resolve annoying compile errors.
#define min(a,b) (((a)<(b))?(a):(b))
#define max(a,b) (((a)>(b))?(a):(b))

// Fast min/max assigns to use with AVX.
// Requires g++ 9.2.0.
template<typename T>
__attribute__((always_inline)) void chkmin(T& a, const T& b) {
    a=(a<b)?a:b;
}

template<typename T>
__attribute__((always_inline)) void chkmax(T& a, const T& b) {
    a=(a>b)?a:b;
}
 
//Constants.
#define MOD (ll(998244353))
#define MAX 300001
#define mag 320
const long double PI=3.14159265358979;
 
//Pairs and 3-pairs.
#define p1 first
#define p2 second.first
#define p3 second.second
#define fi first
#define se second
#define pii(element_type) pair<element_type,element_type>
#define piii(element_type) pair<element_type,pii(element_type)>
 
//Quick power of 2.
#define pow2(x) (ll(1)<<x)
 
//Short for-loops.
#define ff(i,__,___) for(int i=__;i<=___;i++)
#define rr(i,__,___) for(int i=__;i>=___;i--)
 
//Typedefs.
#define bi BigInt
typedef long long ll;
typedef long double ld;
typedef short sh;

// Binpow and stuff
ll BOW(ll a, ll x, ll p)
{
	if (!x) return 1;
	ll res=BOW(a,x/2,p);
	res*=res;
	res%=p;
	if (x%2) res*=a;
	return res%p;
}
ll INV(ll a, ll p)
{
	return BOW(a,p-2,p);
}
//---------END-------//
#endif
vector<int> gt[100001],vec;
int n,m,i,j,k,t,t1,u,v,a,b;
int stat[100001];
int dp[100001][3];
void dfs(int x, int p) {
    dp[x][0]=0;
    dp[x][1]=0;
    dp[x][2]=0;
    for (auto g : gt[x]) if (g-p) {
        dfs(g,x);
        dp[x][0]+=min(dp[g][0],min(dp[g][1]+1,dp[g][2]+1));
        dp[x][1]+=min(dp[g][0],min(dp[g][1],dp[g][2]+1));
        dp[x][2]+=min(dp[g][0],min(dp[g][1]+1,dp[g][2]));
    }
    if (stat[x]==1) {
        dp[x][0]=1e9;
        dp[x][2]=1e9;
    }
    if (stat[x]==2) {
        dp[x][0]=1e9;
        dp[x][1]=1e9;
    }
    // if (x==1 && a && stat[x]) vec.pop_back(); 
}
int calc() {
    vec.clear();
    dfs(1,-1);
    // for (auto g : vec) cout<<g<<' ';
    // cout<<endl;
    // vec.pop_back();
    return min(dp[1][0],min(dp[1][1],dp[1][2]));
}

void initialize(int N, vector<int> A, vector<int> B) {
    n=N;
    for (i=1;i<n;i++) {
        gt[A[i-1]].push_back(B[i-1]);
        gt[B[i-1]].push_back(A[i-1]);
    }
}
int cat(int v) {
    stat[v]=1;
    return calc();
}
int dog(int v) {
    stat[v]=2;
    return calc();
}
int neighbor(int v) {
    stat[v]=0;
    return calc();
}
// N;

Compilation message

catdog.cpp:23: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
   23 | #pragma comment(linker, "/stack:200000000")
      |

Subtask #1
8.0 / 8.0

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

Subtask #2
30.0 / 30.0

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

Subtask #3
0 / 62.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2636 KB Output is correct
2 Correct 2 ms 2636 KB Output is correct
3 Correct 3 ms 2636 KB Output is correct
4 Correct 2 ms 2636 KB Output is correct
5 Correct 2 ms 2636 KB Output is correct
6 Correct 2 ms 2636 KB Output is correct
7 Correct 2 ms 2636 KB Output is correct
8 Correct 2 ms 2636 KB Output is correct
9 Correct 2 ms 2540 KB Output is correct
10 Correct 2 ms 2652 KB Output is correct
11 Correct 2 ms 2636 KB Output is correct
12 Correct 2 ms 2636 KB Output is correct
13 Correct 2 ms 2636 KB Output is correct
14 Correct 2 ms 2636 KB Output is correct
15 Correct 2 ms 2636 KB Output is correct
16 Correct 2 ms 2636 KB Output is correct
17 Correct 13 ms 2712 KB Output is correct
18 Correct 16 ms 2636 KB Output is correct
19 Correct 9 ms 2636 KB Output is correct
20 Correct 2 ms 2636 KB Output is correct
21 Correct 4 ms 2636 KB Output is correct
22 Correct 5 ms 2636 KB Output is correct
23 Correct 20 ms 2720 KB Output is correct
24 Correct 15 ms 2716 KB Output is correct
25 Correct 8 ms 2648 KB Output is correct
26 Correct 5 ms 2636 KB Output is correct
27 Correct 4 ms 2636 KB Output is correct
28 Correct 5 ms 2648 KB Output is correct
29 Correct 20 ms 2764 KB Output is correct
30 Correct 4 ms 2636 KB Output is correct
31 Correct 3 ms 2636 KB Output is correct
32 Correct 5 ms 2636 KB Output is correct
33 Execution timed out 3089 ms 7464 KB Time limit exceeded
34 Halted 0 ms 0 KB -