Submission #1035062

#TimeUsernameProblemLanguageResultExecution timeMemory
1035062irmuun송신탑 (IOI22_towers)C++17
0 / 100
4064 ms2256 KiB
#include<bits/stdc++.h> #include "towers.h" using namespace std; #define ll long long #define pb push_back #define ff first #define ss second #define all(s) s.begin(),s.end() #define rall(s) s.rbegin(),s.rend() int n; vector<pair<int,int>>h; vector<bool>used; void init(int N,vector<int>H){ n=N; for(int i=0;i<n;i++){ h.pb({H[i],i}); } sort(all(h)); } int max_towers(int L,int R,int D){ used.resize(n,0); int ans=0; for(auto [x,i]:h){ bool add=true; int mx=0; for(int j=i-1;j>=0;j--){ if(used[j]){ if(mx<x+D){ add=false; } } } mx=0; for(int j=i+1;j<n;j++){ if(used[j]){ if(mx<x+D){ add=false; } } } if(add){ ans++; used[i]=true; } } return ans; }
#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...