제출 #944185

#제출 시각아이디문제언어결과실행 시간메모리
944185beepbeepsheep모임들 (IOI18_meetings)C++17
0 / 100
5575 ms3268 KiB
#include "meetings.h" #include <bits/stdc++.h> using namespace std; #pragma GCC optimize("O3,unroll-loops") #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt") #define ll long long const ll inf=1e18; std::vector<long long> minimum_costs(std::vector<int> H, std::vector<int> L, std::vector<int> R) { ll n=H.size(); ll q=L.size(); vector<ll> ans; for (int i=0;i<q;i++){ ll tot=0,curr=0; for (int j=L[i];j<=R[i];j++){ if (H[j]==1) curr++; else tot=max(tot,curr),curr=0; } tot=max(tot,curr); ans.emplace_back((R[i]-L[i]+1)*2-tot); } return ans; }

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

meetings.cpp: In function 'std::vector<long long int> minimum_costs(std::vector<int>, std::vector<int>, std::vector<int>)':
meetings.cpp:11:8: warning: unused variable 'n' [-Wunused-variable]
   11 |     ll n=H.size();
      |        ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...