제출 #1042805

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1042805		vjudge1	휴가 (IOI14_holiday)	C++17	23 / 100	20 ms	6236 KiB

holiday

#include<bits/stdc++.h>
using namespace std;
#define task "task"
#define ii pair<int,int>
#define fi first
#define se second
//#define int long long
#define ll long long
#define ld double
#define mp make_pair
#define lg2 21
#define iii pair<int,ii>
#define iiii pair<ii,ii>
#define fii fi.fi
#define fis fi.se
#define sfi se.fi
#define see se.se
#define base 29
int dx[]={0LL,0LL,1,-1,1,1,-1,-1};
int dy[]={1,-1,0LL,0LL,1,-1,1,-1};
const int maxn=3e5+5;
const int mod=998244353;
const int maxi=1000;
int n,s,d,a[maxn];
long long int findMaxAttraction(int n, int start, int d, int attraction[]) {
        int64_t ans=0,cur=0;
        multiset<int>tovis;
        for(int i=0;i<n;i++){
            cur+=attraction[i];
            tovis.insert(attraction[i]);
            while(d-i<tovis.size()){
                cur-=*tovis.begin();
                tovis.erase(tovis.begin());
            }
            ans=max(ans,cur);
        }
        return ans;
    }

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

holiday.cpp: In function 'long long int findMaxAttraction(int, int, int, int*)':
holiday.cpp:31:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::multiset<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   31 |             while(d-i<tovis.size()){
      |                   ~~~^~~~~~~~~~~~~

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