제출 #1115516

#제출 시각아이디문제언어결과실행 시간메모리
1115516EfeBabagilJobs (BOI24_jobs)C++14
0 / 100
118 ms9824 KiB
#include <bits/stdc++.h> using namespace std; #define int long long const int N=1e5+5; const int mod=1e9+7; int32_t main() { int n,s; cin>>n>>s; vector<array<int,3>> jobs(n+1); vector<int> vis(n+1); int mon=s; jobs[0]={0,-1,0}; vis[0]=1; for(int i=1;i<=n;i++) { int a,b; cin>>a>>b; jobs[i]={a,b,i}; if(b==0) { if(a>0) { mon+=a; vis[i]=1; } } } for(int i=n;i>0;i--) { array<int,3> x=jobs[i]; if(x[0]<=0) continue; int prof=0; vector<int> done; //6 5 4 3 while(!vis[x[2]]) { prof+=x[0]; if(prof<=0){ break; } x=jobs[x[1]]; done.push_back(x[2]); } if(prof>0) { mon+=prof; } for(int i=0;i<done.size();i++) vis[done[i]]=1; } cout<<mon-s; return 0; } // 1-> 3 0 // 2-> -3 1 // 3-> -3 0 // 4-> 2 1 // 5-> 6 3 // 6-> -4 5

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

Main.cpp: In function 'int32_t main()':
Main.cpp:61:22: 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]
   61 |         for(int i=0;i<done.size();i++)
      |                     ~^~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...