제출 #1162383

#제출 시각아이디문제언어결과실행 시간메모리
11623838pete8A Light Inconvenience (CEOI23_light)C++20
5 / 100
129 ms408 KiB
#include "light.h" #include<iostream> #include<stack> #include<map> #include<vector> #include<string> #include<cassert> #include<unordered_map> #include <queue> #include <cstdint> #include<cstring> #include<limits.h> #include<cmath> #include<set> #include<algorithm> #include <iomanip> #include<numeric> #include<complex> #include<bitset> using namespace std; #define ll long long #define f first #define s second #define pii pair<int,int> #define ppii pair<int,pii> #define vi vector<int> #define pb push_back #define all(x) x.begin(),x.end() #define rall(x) x.rbegin(),x.rend() #define F(n) for(int i=0;i<n;i++) #define lb lower_bound #define ub upper_bound #define fastio ios::sync_with_stdio(false);cin.tie(NULL); #pragma GCC optimize ("03,unroll-lopps") #define int long long int cnt,n,yes; void prepare(){ cnt = 0; yes=0; n=1; } vector<int>have; pair<long long, std::vector<long long>> join(long long p){ n+=p; pair<int,vector<int>>ans; ans.f=p; if(yes){ ans.s.pb(1); if(n!=1)ans.s.pb(n); return ans; } for(int i=1;i<=n;i=(2*i)+1){ if(n-i+1!=1)ans.s.pb(n-i+1); } ans.s.pb(1); reverse(all(ans.s)); if(ans.s.size()>150)assert(0); return ans; } pair<long long, std::vector<long long>> leave(long long p){ if(yes)assert(0); yes=1; n-=p; pair<int,vector<int>>ans; ans.f=p; ans.s.pb(1); if(n!=1)ans.s.pb(n); return ans; }

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

light.cpp:34:40: warning: bad option '-funroll-lopps' to pragma 'optimize' [-Wpragmas]
   34 | #pragma GCC optimize ("03,unroll-lopps")
      |                                        ^
light.cpp:37:14: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
   37 | void prepare(){
      |              ^
light.cpp:43:57: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
   43 | pair<long long, std::vector<long long>> join(long long p){
      |                                                         ^
light.cpp:60:58: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
   60 | pair<long long, std::vector<long long>> leave(long long p){
      |                                                          ^
#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...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...