이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
const ll MOD=1e9+7;
using namespace std;
ll N,M,s[500005];
map <pair<ll,ll>,ll> a;
map <pair<ll,ll>,ll> pref;
map <pair<ll,ll>,ll> suff;
vector <pair<ll,ll> > vec;
int main(){
cin>>N>>M;
for(int i=1;i<=M;i++){
cin>>s[i];
for(int j=1;j<=s[i];j++){
ll y;
cin>>y;
a[{i,j}]=y;
}
pref[{i,0}]=0;
suff[{i,s[i]+1}]=0;
for(int j=1;j<=s[i];j++){
pref[{i,j}]=pref[{i,j-1}]+a[{i,j}];
}
for(int j=s[i];j>=1;j--){
suff[{i,j}]=suff[{i,j+1}]+a[{i,j}];
}
for(int j=1;j<=s[i];j++){
ll l=N-suff[{i,j}]+1;
ll r=pref[{i,j}];
if(l<=r){
vec.push_back({l,r});
}
}
}
sort(vec.begin(),vec.end());
if(vec.empty()){
cout<<0<<endl;
return 0;
}
ll l=vec[0].fi;
ll r=vec[0].se;
ll ans=r-l+1;
for(int i=1;i<vec.size();i++){
if(vec[i].fi>r){
l=vec[i].fi;
r=vec[i].se;
ans+=vec[i].se-vec[i].fi+1;
}
else if(vec[i].se>r){
l=vec[i].fi;
r=vec[i].se;
ans+=vec[i].se-r;
}
}
cout<<ans<<endl;
}
컴파일 시 표준 에러 (stderr) 메시지
lasers.cpp: In function 'int main()':
lasers.cpp:46:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
46 | for(int i=1;i<vec.size();i++){
| ~^~~~~~~~~~~
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |