제출 #1056049

#제출 시각아이디문제언어결과실행 시간메모리
1056049pawned송신탑 (IOI22_towers)C++17
4 / 100
521 ms1368 KiB
#pragma GCC optimize("O1,O2,O3,Ofast,unroll-loops") #include <bits/stdc++.h> using namespace std; #define fi first #define se second #define pb push_back typedef long long ll; typedef pair<int, int> ii; typedef vector<int> vi; #include "towers.h" int N; vi H; int maxv = -1; int maxp = -1; void init(int N_g, vi H_g) { N = N_g; H = H_g; for (int i = 0; i < N; i++) { if (H[i] > maxv) { maxv = H[i]; maxp = i; } } } int max_towers(int L, int R, int D) { if (L <= maxp && maxp <= R) { if (H[L] <= maxv - D && H[R] <= maxv - D) return 2; return 1; } return 1; }
#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...