답안 #218189

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
218189 2020-04-01T11:57:05 Z Sho10 Colouring a rectangle (eJOI19_colouring) C++14
0 / 100
136 ms 14688 KB
/*
ID: Sho10
LANG: C++
*/
#include <bits/stdc++.h> //Andrei Alexandru a.k.a Sho10
#define ll long long int
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define all(a) (a).begin(), (a).end()
#define sz size
#define f first
#define s second
#define pb push_back
#define er erase
#define in insert
#define mp make_pair
#define pi pair
#define rc(s) return cout<<s,0
#define endl '\n'
#define mod 1000000007
#define PI 3.14159265359
#define CODE_START  ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
ll n,m,a[400005],b[400005];
int32_t main(){
CODE_START;
cin>>n>>m;
for(ll i=0;i<n+m-1;i++)
    cin>>a[i];
for(ll i=0;i<n+m-1;i++)
{
    cin>>b[i];
}
ll sum=0;
ll ans=0;
ll l=(n+m-1)/2,r=(n+m-1)/2;
ll s1=-1;
for(ll i=0;i<=(n+m-1/2);i++)
{
    if(l==r){
        sum=0;
    }else {
    sum=sum+b[l]+b[r];
}
if(s1==-1&&i%2==0){
    sum=sum+a[(n+m-1)/2];
}
if(sum<a[i]){
    ans=ans+sum;
    sum=0;
    if(i%2==0){
        s1=1;
    }
}else {
ans=ans+a[i];
}
l--;
r++;
if(i%2==0&&s1==-1){
    sum=sum-a[(n+m-1)/2];
}
}
cout<<ans<<endl;
}







# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Incorrect 4 ms 384 KB Output isn't correct
3 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Incorrect 4 ms 384 KB Output isn't correct
3 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Incorrect 4 ms 384 KB Output isn't correct
3 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Incorrect 4 ms 384 KB Output isn't correct
3 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Runtime error 64 ms 8312 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Runtime error 136 ms 14688 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Incorrect 4 ms 384 KB Output isn't correct
3 Halted 0 ms 0 KB -