제출 #785585

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
785585		kebine	Sprinkler (JOI22_sprinkler)	C++17	3 / 100	212 ms	14148 KiB

sprinkler

#include<bits/stdc++.h>
 
#define sherina ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define pb push_back
#define int long long
#define INF 1e18
#define endl '\n'
 
using namespace std;

int n , l , a , b , h[200005] , q , t , x , d , w, dist[20005];
vector < int > adj[200005];
bool vis[200005];
vector <int > v;

void bfs(int s){
   vis[s] = true;
   queue < int > q;
   q.push(s);
   while(!q.empty()){
      int u = q.front(); q.pop();
      v.pb(u);
      for(int j = 0 ; j < adj[u].size() ; j++){
         int i = adj[u][j];
         if(vis[i]) continue;
         if(dist[u] == d) continue;
         dist[i] = dist[u] + 1;
         vis[i] = true;
         q.push(i);
      }
   }
}

signed main(){
   cin >> n >> l;
   for(int i = 1 ; i < n ; i++){
      cin >> a >> b;
      adj[a].pb(b);
      adj[b].pb(a);
   }
   for(int i = 1 ; i <= n ; i++) cin >> h[i];
   cin >> q;
   while(q--){
      cin >> t;
      if(t == 1){
         v.clear();
         cin >> x >> d >> w;
         for(int i = 1 ; i <= n ; i++){
            vis[i] = false;
            dist[i] = 0;
         }
         bfs(x);
         for(int i = 0 ; i < v.size() ; i++){
            h[v[i]] = (h[v[i]] * w) % l;
         }

      }
      else{
         cin >> x;
         cout << h[x] << endl;
      }
   }
}

컴파일 시 표준 에러 (stderr) 메시지

sprinkler.cpp: In function 'void bfs(long long int)':
sprinkler.cpp:23:25: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   23 |       for(int j = 0 ; j < adj[u].size() ; j++){
      |                       ~~^~~~~~~~~~~~~~~
sprinkler.cpp: In function 'int main()':
sprinkler.cpp:53:28: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   53 |          for(int i = 0 ; i < v.size() ; i++){
      |                          ~~^~~~~~~~~~

• Subtask 1: 3 / 3
• Subtask 2: 0 / 9
• Subtask 3: 0 / 29
• Subtask 4: 0 / 12
• Subtask 5: 0 / 30
• Subtask 6: 0 / 17