Submission #838133

#TimeUsernameProblemLanguageResultExecution timeMemory
838133Dremix10Radio Towers (IOI22_towers)C++17
4 / 100
796 ms1480 KiB
#include "towers.h" #include <bits/stdc++.h> using namespace std; typedef long long ll; typedef pair<int,int> pi; typedef pair<ll,ll> pl; #define F first #define S second #define all(x) (x).begin(),(x).end() const int N = 3e5+5; const int MOD = 1e9+7; const ll INF = 1e18+5; #ifdef dremix #define p(x) cerr<<#x<<" = "<<x<<endl; #define pv(x) cerr<<#x<<" = {";for(auto v : x)cerr<<v<<", ";cerr<<"}"<<endl; #else #define p(x) {} #define pv(x) {} #endif vector<int> arr; int n,k; void init(int N, vector<int> H) { n = N; arr = H; int i; k = 0; for(i=1;i<n;i++){ if(arr[i] > arr[i-1])k = i; } } int max_towers(int L, int R, int D) { if(L < k && R > k && arr[L] + D <= arr[k] && arr[R] + D <= arr[k])return 2; 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...