#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 CHECK();
void setio(){
freopen("/Users/iantsai/cpp/input.txt","r",stdin);
freopen("/Users/iantsai/cpp/output.txt","w",stdout);
}
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
void setio(){}
#define debug(x...)
#endif
#define TOI_is_so_de ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);setio();
const int mxn = 6005, mxC = 1e6 + 5, shift = 1e6;
vector<int>adj[mxn];
int n, m, k, l, d[mxn], ans[mxn], f[2][2 * mxC];
bool in[mxn];
void dfs(int v){
for(auto u : adj[v]){
d[u] += d[v];
dfs(u);
}
}
void calc(int v){
debug(v, d[v]);
in[v] = 1;
for(int i = 0; i <= n; i++){
if(in[i]){
f[0][d[i] - d[v] + l + 1]++;
}
else{
f[1][d[i] + l + 1 - d[v] + shift]++;
}
}
if(v > n){
if(f[1][k - d[v] + shift]) ans[v] = 1;
else{
for(int i = 1; i * i <= k - d[v]; i++){
if((k - d[v]) % i) continue;
if(f[0][i] or f[0][(k - d[v]) / i]){
ans[v] = 1;
break;
}
}
}
}
for(auto u : adj[v]){
calc(u);
}
for(int i = 0; i <= n; i++){
if(in[i]){
f[0][d[i] - d[v] + l + 1]--;
}
else{
f[1][d[i] + l + 1 - d[v] + shift]--;
}
}
in[v] = 0;
}
void solve(){
cin >> n >> m >> k >> l;
for(int i = 1, p; i <= n + m; i++){
cin >> p >> d[i];
adj[p].pb(i);
d[i]++;
}
dfs(0);
f[1][shift] = 1;
calc(0);
for(int i = n + 1; i <= n + m; i++){
cout << (ans[i] ? "YES\n" : "NO\n");
}
}
signed main(){
TOI_is_so_de;
int t = 1;
//cin >> t;
while(t--){
solve();
}
#ifdef local
CHECK();
#endif
}
/*
input:
*/
#ifdef local
void CHECK(){
cerr << "\n[Time]: " << 1000.0 * clock() / CLOCKS_PER_SEC << " ms.\n";
function<bool(string,string)> compareFiles = [](string p1, string p2)->bool {
std::ifstream file1(p1);
std::ifstream file2(p2);
if(!file1.is_open() || !file2.is_open()) return false;
std::string line1, line2;
while (getline(file1, line1) && getline(file2, line2)) {
if (line1 != line2)return false;
}
int cnta = 0, cntb = 0;
while(getline(file1,line1))cnta++;
while(getline(file2,line2))cntb++;
return cntb - cnta <= 1;
};
bool check = compareFiles("output.txt","expected.txt");
if(check) cerr<<"ACCEPTED\n";
else cerr<<"WRONG ANSWER!\n";
}
#else
#endif
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
1 ms |
604 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Runtime error |
3 ms |
1884 KB |
Execution killed with signal 11 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
1 ms |
604 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
