Submission #781943

#TimeUsernameProblemLanguageResultExecution timeMemory
781943FEDIKUS송신탑 (IOI22_towers)C++17
0 / 100
11 ms1176 KiB
#include "towers.h" #include <bits/stdc++.h> using namespace std; int maxi=-1; vector<int> *h; void init(int n, vector<int> _h) { h=&_h; maxi=max_element((*h).begin(),(*h).end())-(*h).begin(); } int max_towers(int l, int r, int d) { if(l<maxi && maxi<r){ if((*h)[l]+d<=(*h)[maxi] && (*h)[r]+d<=(*h)[maxi]) return 2; else return 1; }else 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...