제출 #682978

#제출 시각아이디문제언어결과실행 시간메모리
682978irmuun송신탑 (IOI22_towers)C++17
0 / 100
570 ms1436 KiB
#include<bits/stdc++.h> #include "towers.h" using namespace std; const int N=1e5; int n,k; vector<int>a; void init(int N,vector<int>h){ n=N; a=h; for(int i=0;i<N;i++){ if((i==0||(i>0&&h[i-1]))&&(i==n-1||(i<n-1&&h[i]<h[i+1]))){ k=i; } } } int max_towers(int l,int r,int d){ if(l==r){ return 1; } if(l<=k&&k<=r&&a[l]+d<=a[k]&&a[r]+d<=a[k]){ return 2; } 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...