제출 #676789

#제출 시각아이디문제언어결과실행 시간메모리
676789ToroTNJust Long Neckties (JOI20_ho_t1)C++14
100 / 100
96 ms14104 KiB
#include<bits/stdc++.h> using namespace std; #define pb push_back #define X first #define Y second int n,m,a[200005],b[200005],ti[200005],chng[200005],idx[200005],l[200005],r[200005]; vector<int> v; vector<pair<int,int> > p; int main() { ios_base::sync_with_stdio(0),cin.tie(0); cin >> n; for(int i=1;i<=n+1;i++)cin >> a[i]; for(int i=1;i<=n;i++)cin >> b[i]; for(int i=1;i<=n;i++) { v.pb(b[i]); } sort(v.begin(),v.end()); for(int i=0;i<v.size();i++)ti[i+1]=v[i]; for(int i=1;i<=n+1;i++) { p.pb({a[i],i}); } sort(p.begin(),p.end()); for(int i=0;i<p.size();i++) { idx[p[i].second]=i+1; chng[i+1]=p[i].X; } l[1]=max(-ti[1]+chng[1],0); for(int i=2;i<=n;i++) { l[i]=max(l[i-1],max(-ti[i]+chng[i],0)); } r[n+1]=max(-ti[n]+chng[n+1],0); for(int i=n;i>=2;i--) { r[i]=max(r[i+1],max(-ti[i-1]+chng[i],0)); } /*printf("l\n"); for(int i=1;i<=n;i++) { printf("%d ",l[i]); } printf("\n"); printf("r\n"); for(int i=2;i<=n+1;i++) { printf("%d ",r[i]); } printf("\n");*/ for(int i=1;i<=n+1;i++) { printf("%d ",max(l[idx[i]-1],r[idx[i]+1])); } }

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

ho_t1.cpp: In function 'int main()':
ho_t1.cpp:20:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   20 |     for(int i=0;i<v.size();i++)ti[i+1]=v[i];
      |                 ~^~~~~~~~~
ho_t1.cpp:26:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 |     for(int i=0;i<p.size();i++)
      |                 ~^~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...