제출 #424413

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
424413		APROHACK	휴가 (IOI14_holiday)	C++14	0 / 100	18 ms	1988 KiB

holiday

#include"holiday.h"
#include <bits/stdc++.h>
#define PB push_back
#define F first
#define S second
using namespace std;
int att[100000];
struct segTree{
    long long dd, ht, mid, val1, val2;
    segTree *L, *R;
    segTree(int l, int r){
        dd=l;
        ht=r;
        mid=(dd+ht)/2;
        if(dd!=ht){
            L=new segTree(l, mid);
            R=new segTree(mid+1, r);
        }
        val1=0;
        val2=0;
    }
    void encender(int ps, bool enc){
        if(dd==ht){
            if(enc){
                val1++;
                val2+=att[ps];
            }else{
                val1=0;
                val2=0;
            }
            return ;
        }else{
            if(ps<=mid)L->encender(ps, enc);
            else R->encender(ps, enc);
            val1=L->val1+R->val1;
            val2=L->val2+R->val2;
        }
    }
    long long query(int cant){
        if(cant==val1)return val2;
        if(cant<=R->val1){
            return R->query(cant);           
        }else if(cant>R->val1){
            if(cant>L->val1){
                cant=L->val1+R->val1;
            }
            return R->val2+L->query((cant-R->val1));
        }
    }
};
long long int findMaxAttraction(int n, int start, int d, int attraction[]) {
    for(int i = 0 ; i < n ; i++)att[i]=attraction[i];
    //priority_queue<long long>pq;
    long long  total = 0;
    segTree *st=new segTree(0, 101);
    for(int i = 0 ; i <= d-1 ; i++){
        //if(start+i<n)pq.push(attraction[i+start]);
        for(int j = 0 ; j<= (d-i) && (start-j)>=0; j++){
            st->encender(att[i], true);
            total=max(total, st->query((d-i)));
            
        }
    }
    return total;
}

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

holiday.cpp: In member function 'long long int segTree::query(int)':
holiday.cpp:49:5: warning: control reaches end of non-void function [-Wreturn-type]
   49 |     }
      |     ^

• Subtask 1: 0 / 7
• Subtask 2: 0 / 23
• Subtask 3: 0 / 17
• Subtask 4: 0 / 53