oj.uz

답안 #736108

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
736108 2023-05-05T08:34:19 Z Sam_a17 Sprinkler (JOI22_sprinkler) C++17
53 / 100
 424 ms 29392 KB 
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
//#include "temp.cpp"
#include <cstdio>
using namespace std;
 
#ifndef ONLINE_JUDGE
#define dbg(x) cerr << #x <<" "; print(x); cerr << endl;
#else
#define dbg(x)
#endif
 
#define sz(x) (int((x).size()))
#define len(x) (int)x.length()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define clr(x) (x).clear()
#define uniq(x) x.resize(unique(all(x)) - x.begin());
#define blt(x) __builtin_popcount(x)
 
#define pb push_back
#define popf pop_front
#define popb pop_back
 
void print(long long t) {cerr << t;}
void print(int t) {cerr << t;}
void print(string t) {cerr << t;}
void print(char t) {cerr << t;}
void print(double t) {cerr << t;}
void print(long double t) {cerr << t;}
void print(unsigned long long t) {cerr << t;}
 
template <class T, class V> void print(pair <T, V> p);
template <class T> void print(vector <T> v);
template <class T> void print(set <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T> void print(multiset <T> v);
template <class T, class V> void print(T v[],V n) {cerr << "["; for(int i = 0; i < n; i++) {print(v[i]); cerr << " "; } cerr << "]";}
template <class T, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";}
template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(deque <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]";}
 
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define nl '\n'
 
// for grid problems
int dx[8] = {-1,0,1,0,1,-1,1,-1};
int dy[8] = {0,1,0,-1,1,1,-1,-1};
 
// lowest / (1 << 17) >= 1e5 / (1 << 18) >= 2e5 / (1 << 21) >= 1e6
void fastIO() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr); cout.tie(nullptr);
}
// file in/out
void setIO(string str = "") {
  fastIO();
 
  if (str != "") {
    freopen((str + ".in").c_str(), "r", stdin);
    freopen((str + ".out").c_str(), "w", stdout);
  }
}
// Indexed Set
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const int N = 2e5 + 10;
vector<int> adj[N];
long long n, l, h[N], q;
long long d1[N], d2[N];
int dd[N];
int p[N];

void bfs(int node, int dist, long long m) {
  queue<pair<int, int>> q;
  q.push({node, 0});
  vector<bool> used(n + 1);
  used[node] = true;
  q.push({node, 0});
  h[node] = (h[node] * m) % l;

  while (!q.empty()) {
    auto u = q.front();
    q.pop();

    for(auto i: adj[u.first]) {
      if(used[i]) continue;
      used[i] = true;
      if(u.second + 1 <= dist) {
        h[i] = (h[i] * m) % l;
        q.push({i, u.second + 1});
      }
    }
  }
}

void dfs(int node, int parent) {
  p[node] = parent;
  for(auto i: adj[node]) {
    if(i == parent) continue;
    dfs(i, node);
  }
}

void solve_() {
  cin >> n >> l;

  for(int i = 1; i <= n - 1; i++) {
    int a, b; cin >> a >> b;
    adj[a].push_back(b);
    adj[b].push_back(a);
  }

  for(int i = 1; i <= n; i++) {
    cin >> h[i], dd[i] = -1;
    d1[i] = d2[i] = 1;
  }

  d1[0] = d2[0] = 1;

  dfs(1, 0);

  cin >> q;
  while(q--) {
    int type; cin >> type;

    if(type == 1) {
      long long x, d, w;
      cin >> x >> d >> w;

      if(n <= 2000) {
        bfs(x, d, w);
        continue;
      }

      if(d == 0) {
        h[x] *= w;
        h[x] %= l;
      }
      else if(d == 1) {
        h[x] *= w;
        h[x] %= l;

        if(p[x]) {
          h[p[x]] *= w;
          h[p[x]] %= l;
        }

        d1[x] *= w;
        d1[x] %= l;
      } else if(d == 2) {
        int u = p[x], uu = p[p[x]];

        // if(u) {
          d1[u] *= w;
          d1[u] %= l;
          h[u] *= w;
          h[u] %= l;
        // }

        if(uu) {
          h[uu] *= w;
          h[uu] %= l;
        }

        d2[x] *= w;
        d2[x] %= l;

        d1[x] *= w;
        d1[x] %= l;
      } else {
        int cnt = d;
        while(x != 0 && cnt >= 0) {
          dd[x] = max(dd[x], cnt);
          cnt--, x = p[x];
        }
      }
    } else {
      long long x; cin >> x;
      long long cur = x;

      if(n <= 2000) {
        cout << h[cur] << '\n';
        continue;
      }

      int cnt = 0, ok = 0;
      while(x != 0 && cnt < 41) {
        if(dd[x] != -1 && dd[x] >= cnt) {
          ok = 1;
          break;
        }
        x = p[x];
        cnt++;
      }

      if(ok) {
        cout << 0 << '\n';
      } else {
        long long ans = h[cur];

        int u = p[cur], uu = p[p[cur]];
        // if(u) {
          ans *= d1[u];
          ans %= l;
        // }

        if(uu) {
          ans *= d2[uu];
          ans %= l;
        }
        cout << ans << '\n';
      }
    }
  }

}
 
int main() {
  setIO();
 
  auto solve = [&](int test_case)-> void {
    while(test_case--) {
      solve_();
    }
  };
 
  int test_cases = 1;
  // cin >> test_cases;
  solve(test_cases);
 
  return 0;
}

Compilation message

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

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 4 ms 5040 KB Output is correct
5 Correct 7 ms 5048 KB Output is correct
6 Correct 12 ms 5164 KB Output is correct
7 Correct 12 ms 5076 KB Output is correct
8 Correct 10 ms 5076 KB Output is correct
9 Correct 3 ms 5040 KB Output is correct
10 Correct 3 ms 5076 KB Output is correct
11 Correct 3 ms 5076 KB Output is correct
12 Correct 3 ms 5076 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct
14 Correct 3 ms 5076 KB Output is correct
15 Correct 3 ms 5076 KB Output is correct
16 Correct 3 ms 5076 KB Output is correct
17 Correct 3 ms 5076 KB Output is correct
18 Correct 3 ms 5036 KB Output is correct
19 Correct 3 ms 4948 KB Output is correct
20 Correct 3 ms 4948 KB Output is correct
21 Correct 3 ms 4948 KB Output is correct
22 Correct 3 ms 4948 KB Output is correct
23 Correct 3 ms 4948 KB Output is correct
24 Correct 3 ms 4948 KB Output is correct
25 Correct 3 ms 4948 KB Output is correct
26 Correct 3 ms 4948 KB Output is correct
27 Correct 3 ms 5076 KB Output is correct
28 Correct 3 ms 4948 KB Output is correct

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 394 ms 21068 KB Output is correct
3 Correct 271 ms 18120 KB Output is correct
4 Correct 355 ms 22580 KB Output is correct
5 Correct 340 ms 19556 KB Output is correct
6 Correct 267 ms 19532 KB Output is correct
7 Correct 247 ms 19784 KB Output is correct
8 Correct 183 ms 20224 KB Output is correct
9 Correct 413 ms 25616 KB Output is correct
10 Correct 272 ms 22324 KB Output is correct
11 Correct 396 ms 21180 KB Output is correct
12 Correct 268 ms 18004 KB Output is correct
13 Correct 192 ms 18508 KB Output is correct
14 Correct 203 ms 18716 KB Output is correct
15 Correct 202 ms 18624 KB Output is correct
16 Correct 208 ms 18556 KB Output is correct
17 Correct 242 ms 19136 KB Output is correct
18 Correct 3 ms 4948 KB Output is correct
19 Correct 3 ms 4948 KB Output is correct
20 Correct 3 ms 4948 KB Output is correct
21 Correct 3 ms 4948 KB Output is correct
22 Correct 3 ms 4992 KB Output is correct

Subtask #3
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 394 ms 21068 KB Output is correct
3 Correct 271 ms 18120 KB Output is correct
4 Correct 355 ms 22580 KB Output is correct
5 Correct 340 ms 19556 KB Output is correct
6 Correct 267 ms 19532 KB Output is correct
7 Correct 247 ms 19784 KB Output is correct
8 Correct 183 ms 20224 KB Output is correct
9 Correct 413 ms 25616 KB Output is correct
10 Correct 272 ms 22324 KB Output is correct
11 Correct 396 ms 21180 KB Output is correct
12 Correct 268 ms 18004 KB Output is correct
13 Correct 192 ms 18508 KB Output is correct
14 Correct 203 ms 18716 KB Output is correct
15 Correct 202 ms 18624 KB Output is correct
16 Correct 208 ms 18556 KB Output is correct
17 Correct 242 ms 19136 KB Output is correct
18 Correct 3 ms 4948 KB Output is correct
19 Correct 3 ms 4948 KB Output is correct
20 Correct 3 ms 4948 KB Output is correct
21 Correct 3 ms 4948 KB Output is correct
22 Correct 3 ms 4992 KB Output is correct
23 Correct 3 ms 4948 KB Output is correct
24 Correct 402 ms 21192 KB Output is correct
25 Correct 293 ms 17996 KB Output is correct
26 Correct 365 ms 23912 KB Output is correct
27 Correct 355 ms 19552 KB Output is correct
28 Correct 286 ms 19712 KB Output is correct
29 Correct 269 ms 19692 KB Output is correct
30 Correct 187 ms 20288 KB Output is correct
31 Correct 424 ms 24416 KB Output is correct
32 Correct 290 ms 22224 KB Output is correct
33 Correct 409 ms 21176 KB Output is correct
34 Correct 318 ms 17876 KB Output is correct
35 Correct 3 ms 5004 KB Output is correct
36 Correct 3 ms 4948 KB Output is correct
37 Correct 3 ms 4948 KB Output is correct
38 Correct 3 ms 4996 KB Output is correct
39 Correct 3 ms 4948 KB Output is correct
40 Correct 3 ms 4948 KB Output is correct
41 Correct 3 ms 4948 KB Output is correct
42 Correct 3 ms 4948 KB Output is correct
43 Correct 3 ms 4948 KB Output is correct
44 Correct 3 ms 5032 KB Output is correct
45 Correct 3 ms 4948 KB Output is correct
46 Correct 3 ms 4948 KB Output is correct
47 Correct 3 ms 4948 KB Output is correct
48 Correct 3 ms 4948 KB Output is correct
49 Correct 3 ms 4948 KB Output is correct

Subtask #4
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 254 ms 22992 KB Output is correct
3 Correct 408 ms 21072 KB Output is correct
4 Correct 283 ms 21636 KB Output is correct
5 Correct 268 ms 18108 KB Output is correct
6 Correct 229 ms 18124 KB Output is correct
7 Correct 231 ms 18288 KB Output is correct
8 Correct 171 ms 18692 KB Output is correct
9 Correct 250 ms 21728 KB Output is correct
10 Correct 417 ms 21960 KB Output is correct
11 Correct 250 ms 18380 KB Output is correct
12 Correct 393 ms 17668 KB Output is correct
13 Correct 281 ms 18516 KB Output is correct
14 Correct 285 ms 18952 KB Output is correct
15 Correct 3 ms 4948 KB Output is correct
16 Correct 4 ms 5008 KB Output is correct
17 Correct 3 ms 4948 KB Output is correct
18 Correct 3 ms 4948 KB Output is correct
19 Correct 3 ms 4948 KB Output is correct

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Incorrect 298 ms 29392 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 4 ms 5040 KB Output is correct
5 Correct 7 ms 5048 KB Output is correct
6 Correct 12 ms 5164 KB Output is correct
7 Correct 12 ms 5076 KB Output is correct
8 Correct 10 ms 5076 KB Output is correct
9 Correct 3 ms 5040 KB Output is correct
10 Correct 3 ms 5076 KB Output is correct
11 Correct 3 ms 5076 KB Output is correct
12 Correct 3 ms 5076 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct
14 Correct 3 ms 5076 KB Output is correct
15 Correct 3 ms 5076 KB Output is correct
16 Correct 3 ms 5076 KB Output is correct
17 Correct 3 ms 5076 KB Output is correct
18 Correct 3 ms 5036 KB Output is correct
19 Correct 3 ms 4948 KB Output is correct
20 Correct 3 ms 4948 KB Output is correct
21 Correct 3 ms 4948 KB Output is correct
22 Correct 3 ms 4948 KB Output is correct
23 Correct 3 ms 4948 KB Output is correct
24 Correct 3 ms 4948 KB Output is correct
25 Correct 3 ms 4948 KB Output is correct
26 Correct 3 ms 4948 KB Output is correct
27 Correct 3 ms 5076 KB Output is correct
28 Correct 3 ms 4948 KB Output is correct
29 Correct 3 ms 4948 KB Output is correct
30 Correct 394 ms 21068 KB Output is correct
31 Correct 271 ms 18120 KB Output is correct
32 Correct 355 ms 22580 KB Output is correct
33 Correct 340 ms 19556 KB Output is correct
34 Correct 267 ms 19532 KB Output is correct
35 Correct 247 ms 19784 KB Output is correct
36 Correct 183 ms 20224 KB Output is correct
37 Correct 413 ms 25616 KB Output is correct
38 Correct 272 ms 22324 KB Output is correct
39 Correct 396 ms 21180 KB Output is correct
40 Correct 268 ms 18004 KB Output is correct
41 Correct 192 ms 18508 KB Output is correct
42 Correct 203 ms 18716 KB Output is correct
43 Correct 202 ms 18624 KB Output is correct
44 Correct 208 ms 18556 KB Output is correct
45 Correct 242 ms 19136 KB Output is correct
46 Correct 3 ms 4948 KB Output is correct
47 Correct 3 ms 4948 KB Output is correct
48 Correct 3 ms 4948 KB Output is correct
49 Correct 3 ms 4948 KB Output is correct
50 Correct 3 ms 4992 KB Output is correct
51 Correct 3 ms 4948 KB Output is correct
52 Correct 402 ms 21192 KB Output is correct
53 Correct 293 ms 17996 KB Output is correct
54 Correct 365 ms 23912 KB Output is correct
55 Correct 355 ms 19552 KB Output is correct
56 Correct 286 ms 19712 KB Output is correct
57 Correct 269 ms 19692 KB Output is correct
58 Correct 187 ms 20288 KB Output is correct
59 Correct 424 ms 24416 KB Output is correct
60 Correct 290 ms 22224 KB Output is correct
61 Correct 409 ms 21176 KB Output is correct
62 Correct 318 ms 17876 KB Output is correct
63 Correct 3 ms 5004 KB Output is correct
64 Correct 3 ms 4948 KB Output is correct
65 Correct 3 ms 4948 KB Output is correct
66 Correct 3 ms 4996 KB Output is correct
67 Correct 3 ms 4948 KB Output is correct
68 Correct 3 ms 4948 KB Output is correct
69 Correct 3 ms 4948 KB Output is correct
70 Correct 3 ms 4948 KB Output is correct
71 Correct 3 ms 4948 KB Output is correct
72 Correct 3 ms 5032 KB Output is correct
73 Correct 3 ms 4948 KB Output is correct
74 Correct 3 ms 4948 KB Output is correct
75 Correct 3 ms 4948 KB Output is correct
76 Correct 3 ms 4948 KB Output is correct
77 Correct 3 ms 4948 KB Output is correct
78 Correct 3 ms 4948 KB Output is correct
79 Correct 254 ms 22992 KB Output is correct
80 Correct 408 ms 21072 KB Output is correct
81 Correct 283 ms 21636 KB Output is correct
82 Correct 268 ms 18108 KB Output is correct
83 Correct 229 ms 18124 KB Output is correct
84 Correct 231 ms 18288 KB Output is correct
85 Correct 171 ms 18692 KB Output is correct
86 Correct 250 ms 21728 KB Output is correct
87 Correct 417 ms 21960 KB Output is correct
88 Correct 250 ms 18380 KB Output is correct
89 Correct 393 ms 17668 KB Output is correct
90 Correct 281 ms 18516 KB Output is correct
91 Correct 285 ms 18952 KB Output is correct
92 Correct 3 ms 4948 KB Output is correct
93 Correct 4 ms 5008 KB Output is correct
94 Correct 3 ms 4948 KB Output is correct
95 Correct 3 ms 4948 KB Output is correct
96 Correct 3 ms 4948 KB Output is correct
97 Correct 3 ms 4948 KB Output is correct
98 Incorrect 298 ms 29392 KB Output isn't correct
99 Halted 0 ms 0 KB -