oj.uz

Submission #944572

# Submission time Handle Problem Language Result Execution time Memory
944572 2024-03-13T01:00:29 Z yeediot Mergers (JOI19_mergers) C++14
0 / 100
 3000 ms 67612 KB 
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define F first
#define S second
#define all(x) x.begin(),x.end()
#define pii pair<int,int>
#define pb push_back
#define sz(x) (int)(x.size())
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
#define vi vector<int>
#define vp vector<pii>
#define vvi vector<vi>
#define ykh mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count())
#define __lg(x) 63-__builtin_clzll(x)
#define pow2(x) (1LL<<x)
void __print(int x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifdef local
void setio(){freopen("/Users/iantsai/Library/Mobile Documents/com~apple~CloudDocs/cpp/Empty.md","r",stdin);}
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
void setio(){}
#define debug(x...)
#endif
void setIO(string s) {
    freopen((s + ".in").c_str(), "r", stdin);
    freopen((s + ".out").c_str(), "w", stdout);
}
struct line{
    int a,b;
    int operator()(const int x)const{
        return a*x+b;
    }
};
bool check(line l1,line l2,line l3){
    return (l3.b-l2.b)*(l1.a-l2.a)<=(l2.b-l1.b)*(l2.a-l3.a);
}
const int mxn=5e5+5;
const int mxk=55;
vector<int>adj[mxn];
int dp[mxn][mxk];
int V[mxn];
int cnt[mxn];
int k;
int ans;
void dfs(int v,int pa=-1){
    for(auto u:adj[v]){
        if(u==pa)continue;
        dfs(u,v);
        for(int i=0;i<=k;i++){
            dp[v][i]+=dp[u][i];
        }
    }
    bool ok=1;
    dp[v][V[v]]++;
    for(int i=0;i<=k;i++){
        if(pa==-1 or (dp[v][i] and cnt[i]!=dp[v][i])){
            ok=0;
            break;
        }
    }
    if(ok)ans++;
    debug(v,ok);
}
signed main(){
    setio();
    ans=0;
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    int n;
    cin>>n>>k;
    for(int i=1;i<n;i++){
        int a,b;
        cin>>a>>b;
        adj[a].pb(b);
        adj[b].pb(a);
    }
    for(int i=1;i<=n;i++){
        cin>>V[i];
        cnt[V[i]]++;
    }
    dfs(1,-1);
    // for(int i=1;i<=n;i++){
    //     for(int j=1;j<=k;j++){
    //         cout<<dp[i][j]<<' ';
    //     }
    //     cout<<'\n';
    // }
    cout<<ceil(ans/2.0)<<'\n';
}
 /*
 input:
 
 */

Compilation message

mergers.cpp: In function 'void setIO(std::string)':
mergers.cpp:42:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   42 |     freopen((s + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
mergers.cpp:43:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   43 |     freopen((s + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 17500 KB Output is correct
2 Correct 4 ms 17600 KB Output is correct
3 Correct 3 ms 17500 KB Output is correct
4 Correct 4 ms 17496 KB Output is correct
5 Correct 4 ms 17600 KB Output is correct
6 Correct 3 ms 17500 KB Output is correct
7 Correct 3 ms 17500 KB Output is correct
8 Correct 4 ms 17500 KB Output is correct
9 Incorrect 5 ms 17584 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #2
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 17500 KB Output is correct
2 Correct 4 ms 17600 KB Output is correct
3 Correct 3 ms 17500 KB Output is correct
4 Correct 4 ms 17496 KB Output is correct
5 Correct 4 ms 17600 KB Output is correct
6 Correct 3 ms 17500 KB Output is correct
7 Correct 3 ms 17500 KB Output is correct
8 Correct 4 ms 17500 KB Output is correct
9 Incorrect 5 ms 17584 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 17500 KB Output is correct
2 Correct 4 ms 17600 KB Output is correct
3 Correct 3 ms 17500 KB Output is correct
4 Correct 4 ms 17496 KB Output is correct
5 Correct 4 ms 17600 KB Output is correct
6 Correct 3 ms 17500 KB Output is correct
7 Correct 3 ms 17500 KB Output is correct
8 Correct 4 ms 17500 KB Output is correct
9 Incorrect 5 ms 17584 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #4
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 60 ms 64556 KB Output is correct
2 Execution timed out 3062 ms 67612 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 17500 KB Output is correct
2 Correct 4 ms 17600 KB Output is correct
3 Correct 3 ms 17500 KB Output is correct
4 Correct 4 ms 17496 KB Output is correct
5 Correct 4 ms 17600 KB Output is correct
6 Correct 3 ms 17500 KB Output is correct
7 Correct 3 ms 17500 KB Output is correct
8 Correct 4 ms 17500 KB Output is correct
9 Incorrect 5 ms 17584 KB Output isn't correct
10 Halted 0 ms 0 KB -