# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
944202 | 2024-03-12T09:59:12 Z | beepbeepsheep | 모임들 (IOI18_meetings) | C++17 | 5500 ms | 4760 KB |
#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> __attribute__((optimize("O3","unroll-loops"), target("arch=sandybridge"), target("avx,avx2,fma"))) 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; int *h,*l,*r; h=new int[n]; l=new int[q]; r=new int[q]; for (int i=0;i<n;i++) h[i]=H[i]; for (int i=0;i<q;i++) l[i]=L[i]; for (int i=0;i<q;i++) r[i]=R[i]; for (int i=0;i<q;i++){ int tot=0,cnt=0; for (int j=l[i];j<=r[i];j++){ cnt+=2-h[j]; if (h[j]==2 & (bool)cnt) tot=max(tot,cnt),cnt=0; } if (tot<cnt) tot=cnt; ans.emplace_back((r[i]-l[i]+1)*2-tot); } return ans; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 344 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 344 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Correct | 363 ms | 2280 KB | Output is correct |
3 | Execution timed out | 5546 ms | 4760 KB | Time limit exceeded |
4 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Correct | 363 ms | 2280 KB | Output is correct |
3 | Execution timed out | 5546 ms | 4760 KB | Time limit exceeded |
4 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 344 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |