제출 #1173008

#제출 시각아이디문제언어결과실행 시간메모리
1173008SpyrosAliv송신탑 (IOI22_towers)C++20
4 / 100
256 ms1564 KiB
#include <bits/stdc++.h> using namespace std; int n; vector<int> a; int mxPos = 0, mx = 0; void init(int N, vector<int> A) { n = N; a = A; for (int i = 0; i < n; i++) { if (a[i] > mx) { mx = a[i]; mxPos = i; } } } int max_towers(int l, int r, int d) { if (l >= mxPos || r <= mxPos) return 1; int upp = max(a[l], a[r]) + d; if (upp > mx) return 1; else return 2; }
#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...