제출 #495280

#제출 시각아이디문제언어결과실행 시간메모리
495280reniTrading (IZhO13_trading)C++14
0 / 100
34 ms65540 KiB
#include<iostream> #pragma GCC optimize ("O3") #include<vector> #include<set> using namespace std; multiset<long long>s; vector<long long>v1[3000000],v2[30000000]; int main() { long long i,j,n,m,l,r,x; cin>>n>>m; for(i=1;i<=m;i++) { cin>>l>>r>>x; v1[l].push_back(x-l); v2[r].push_back(x-l); } for(i=1;i<=n;i++) { for(j=0;j<v1[i].size();j++)s.insert(v1[i][j]); if(s.empty()) { cout<<0<<" "; } else { auto it=s.end();it--; cout<<*it+i<<" "; } for(j=0;j<v2[i].size();j++)s.erase(v2[i][j]); } cout<<endl; }

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

trading.cpp: In function 'int main()':
trading.cpp:25:18: 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]
   25 |         for(j=0;j<v1[i].size();j++)s.insert(v1[i][j]);
      |                 ~^~~~~~~~~~~~~
trading.cpp:38:18: 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]
   38 |         for(j=0;j<v2[i].size();j++)s.erase(v2[i][j]);
      |                 ~^~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...