| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 861938 | guagua0407 | Two Dishes (JOI19_dishes) | C++17 | 0 ms | 0 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
//#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int,int>
#define f first
#define s second
#define all(x) x.begin(),x.end()
#define _ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
void setIO(string s) {
freopen((s + ".in").c_str(), "r", stdin);
freopen((s + ".out").c_str(), "w", stdout);
}
const int mxn=1e6+5;
ll a[mxn],S[mxn],Q[mxn];
ll b[mxn],T[mxn],P[mxn];
int pa[mxn],pb[mxn];
ll g[mxn],V[mxn];
vector<int> qa[mxn],qb[mxn];
int n,m;
int main() {_
cin>>n>>m;
for(int i=1;i<=n;i++){
cin>>a[i]>>S[i]>>P[i];
a[i]+=a[i-1];
}
for(int i=1;i<=m;i++){
cin>>b[i]>>T[i]>>Q[i];
b[i]+=b[i-1];
}
for(int i=1;i<=n;i++){
int pos=upper_bound(b,b+m+1,S[i]-a[i])-b-1;
pa[i]=pos;
if(pos>=0) qa[pos].push_back(i);
}
for(int i=1;i<=m;i++){
int pos=upper_bound(a,a+n+1,T[i]-b[i])-a-1;
pb[i]=pos;
if(pos>=0) qb[pos].push_back(i);
}
for(int i=1;i<=m;i++){
if(pb[i]>=0) g[i]=V[i]=Q[i];
}
for(auto v:qb[0]){
if(g[v]<0){
g[v+1]=max(g[v+1]+g[v],V[v+1]);
g[v]=0;
}
V[v]=0;
}
for(int i=1;i<=n;i++){
if(pa[i]>=0){
g[0]+=P[i];
g[pa[i]+1]-=P[i];
if(g[pa[i]+1]<V[pa[i]+1]){
g[pa[i]+2]=max(g[pa[i]+2]+g[pa[i]+1],V[pa[i]+2]);
g[pa[i]+1]=V[pa[i]+1];
}
}
for(auto v:qb[i]){
if(g[v]<0){
g[v+1]=max(g[v+1]+g[v],V[v+1]);
g[v]=0;
}
V[v]=0;
}
}
for(int i=1;i<=m;i++){
g[i]+=g[i-1];
}
cout<<g[m]<<'\n';
return 0;
}
//maybe its multiset not set
//#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int,int>
#define f first
#define s second
#define all(x) x.begin(),x.end()
#define _ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
void setIO(string s) {
freopen((s + ".in").c_str(), "r", stdin);
freopen((s + ".out").c_str(), "w", stdout);
}
const int mxn=1e6+5;
ll a[mxn],S[mxn],Q[mxn];
ll b[mxn],T[mxn],P[mxn];
int pa[mxn],pb[mxn];
ll g[mxn],V[mxn];
vector<int> qa[mxn],qb[mxn];
int n,m;
int main() {_
cin>>n>>m;
for(int i=1;i<=n;i++){
cin>>a[i]>>S[i]>>P[i];
a[i]+=a[i-1];
}
for(int i=1;i<=m;i++){
cin>>b[i]>>T[i]>>Q[i];
b[i]+=b[i-1];
}
for(int i=1;i<=n;i++){
int pos=upper_bound(b,b+m+1,S[i]-a[i])-b-1;
pa[i]=pos;
if(pos>=0) qa[pos].push_back(i);
}
for(int i=1;i<=m;i++){
int pos=upper_bound(a,a+n+1,T[i]-b[i])-a-1;
pb[i]=pos;
if(pos>=0) qb[pos].push_back(i);
}
for(int i=1;i<=m;i++){
if(pb[i]>=0) g[i]=V[i]=Q[i];
}
for(auto v:qb[0]){
if(g[v]<0){
g[v+1]=max(g[v+1]+g[v],V[v+1]);
g[v]=0;
}
V[v]=0;
}
for(int i=1;i<=n;i++){
if(pa[i]>=0){
g[0]+=P[i];
g[pa[i]+1]-=P[i];
if(g[pa[i]+1]<V[pa[i]+1]){
g[pa[i]+2]=max(g[pa[i]+2]+g[pa[i]+1],V[pa[i]+2]);
g[pa[i]+1]=V[pa[i]+1];
}
}
for(auto v:qb[i]){
if(g[v]<0){
g[v+1]=max(g[v+1]+g[v],V[v+1]);
g[v]=0;
}
V[v]=0;
}
}
for(int i=1;i<=m;i++){
g[i]+=g[i-1];
}
cout<<g[m]<<'\n';
return 0;
}
//maybe its multiset not set