제출 #523745

#제출 시각아이디문제언어결과실행 시간메모리
523745mansurGap (APIO16_gap)C++17
0 / 100
3103 ms1100 KiB
#include<bits/stdc++.h> #include "gap.h" #pragma optimize ("g",on) #pragma GCC optimize ("inline") #pragma GCC optimize ("Ofast") #pragma GCC optimize ("unroll-loops") #pragma GCC optimize ("03") #pragma GCC target ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,avx2,mmx,fma,avx,tune=native") //01001101 01100001 01101011 01101000 01100001 01100111 01100001 01111001 using namespace std; #define all(a) a.begin(), a.end() #define rall(a) a.rbegin(), a.rend() #define ll long long #define pb push_back #define sz(a) a.size() #define nl '\n' #define popb pop_back() #define ld double #define ull unsigned long long #define ff first #define ss second #define fix fixed << setprecision #define pii pair<int, int> #define E exit (0) const ll inf = 1e18; ll findGap(int t, int n) { ll li, lj; ll i, j; MinMax(0ll, inf, &li, &lj); ll ans = 0; while (li < lj) { MinMax(li, lj, &i, &j); ans = max(ans, i - li); ans = max(ans, lj - j); li = i, lj = j; } return ans; }

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

gap.cpp:5: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    5 | #pragma optimize ("g",on)
      |
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...