oj.uz

답안 #136086

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
136086 2019-07-24T17:26:41 Z PedroBigMan 3단 점프 (JOI19_jumps) C++14
5 / 100
 1022 ms 524292 KB 
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <string>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
#define REP(i,a,b) for(ll i=a; i<b; i++)
#define pb push_back
#define mp make_pair
#define pl pair<ll,ll>
#define ff first
#define ss second
#define INF ((ll) pow(2,63) -1)
ll insig;
#define In(vecBRO, LENBRO) REP(IBRO,0,LENBRO) {cin>>insig; vecBRO.pb(insig);}
void Out(vector<ll> x) {REP(i,0,x.size()) {cout<<x[i]<<" ";} cout<<endl;}

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    ll N,Q; cin>>N; vector<ll> a; In(a,N); cin>>Q;
    vector< vector<ll> > mx;
    vector<ll> xx; REP(i,0,N) {xx.pb(-1);} REP(i,0,N) {mx.pb(xx);}
    REP(i,0,N)
    {
        mx[i][i]=a[i];
        REP(j,i+1,N)
        {
            mx[i][j]=max(mx[i][j-1],a[j]);
        }
    }
    vector< vector<ll> > ans; REP(i,0,N) {ans.pb(xx);}
    REP(i,2,N)
    {
        ans[i-2][i]=a[i-2]+a[i-1]+a[i];
        for(ll j=i-3;j>=0;j--)
        {
            ans[j][i]=max(ans[j+1][i],a[i]+a[j]+mx[j+1][(ll) floor((ld) (i+j)/2)]);
        }
    }
    vector< vector<ll> > t_ans; REP(i,0,N) {t_ans.pb(xx);}
    REP(i,0,N-2)
    {
        t_ans[i][i+2]=ans[i][i+2];
        REP(j,i+3,N)
        {
            t_ans[i][j]=max(t_ans[i][j-1],ans[i][j]);
        }
    }
    ll l,r;
    REP(i,0,Q)
    {
        cin>>l>>r; cout<<t_ans[l-1][r-1]<<endl;
    }
    return 0;
}

Compilation message

jumps.cpp: In function 'void Out(std::vector<long long int>)':
jumps.cpp:10:33: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define REP(i,a,b) for(ll i=a; i<b; i++)
jumps.cpp:19:29:
 void Out(vector<ll> x) {REP(i,0,x.size()) {cout<<x[i]<<" ";} cout<<endl;}
                             ~~~~~~~~~~~~
jumps.cpp:19:25: note: in expansion of macro 'REP'
 void Out(vector<ll> x) {REP(i,0,x.size()) {cout<<x[i]<<" ";} cout<<endl;}
                         ^~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 416 KB Output is correct
2 Correct 2 ms 632 KB Output is correct
3 Correct 3 ms 632 KB Output is correct
4 Correct 3 ms 632 KB Output is correct
5 Correct 3 ms 632 KB Output is correct
6 Correct 3 ms 632 KB Output is correct
7 Correct 3 ms 636 KB Output is correct
8 Correct 3 ms 632 KB Output is correct
9 Correct 2 ms 632 KB Output is correct
10 Correct 2 ms 504 KB Output is correct

Subtask #2
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 416 KB Output is correct
2 Correct 2 ms 632 KB Output is correct
3 Correct 3 ms 632 KB Output is correct
4 Correct 3 ms 632 KB Output is correct
5 Correct 3 ms 632 KB Output is correct
6 Correct 3 ms 632 KB Output is correct
7 Correct 3 ms 636 KB Output is correct
8 Correct 3 ms 632 KB Output is correct
9 Correct 2 ms 632 KB Output is correct
10 Correct 2 ms 504 KB Output is correct
11 Runtime error 1022 ms 524292 KB Execution killed with signal 9 (could be triggered by violating memory limits)
12 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 496 ms 524292 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #4
0 / 54.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 416 KB Output is correct
2 Correct 2 ms 632 KB Output is correct
3 Correct 3 ms 632 KB Output is correct
4 Correct 3 ms 632 KB Output is correct
5 Correct 3 ms 632 KB Output is correct
6 Correct 3 ms 632 KB Output is correct
7 Correct 3 ms 636 KB Output is correct
8 Correct 3 ms 632 KB Output is correct
9 Correct 2 ms 632 KB Output is correct
10 Correct 2 ms 504 KB Output is correct
11 Runtime error 1022 ms 524292 KB Execution killed with signal 9 (could be triggered by violating memory limits)
12 Halted 0 ms 0 KB -