oj.uz

Submission #795578

# Submission time Handle Problem Language Result Execution time Memory
795578 2023-07-27T11:26:45 Z ln_e Radio Towers (IOI22_towers) C++17
4 / 100
 876 ms 1472 KB 
#include <bits/stdc++.h> //Andrei Alexandru a.k.a Sho
    #include "towers.h"
    using ll=long long;
    using ld=long double;
    int const INF=1000000005;
    ll const LINF=1000000000000000005;
    ll const mod=1000000007;
    ld const PI=3.14159265359;
    ll const MAX_N=3e5+5;
    ld const EPS=0.00000001;
    #pragma GCC optimize("O3")
    #pragma GCC optimize("Ofast")
    #define f first
    #define s second
    #define pb push_back
    #define mp make_pair
    #define endl '\n'
    #define sz(a) (int)a.size()
    #define CODE_START  ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    using namespace std;
int a[100005],pos=0,n;
void init(int N, std::vector<int> H) {
  n=N;
for(ll i=0;i<N;i++)
{
  a[i+1]=H[i];
}
for(ll i=1;i<=n;i++)
{
  if(a[i]>a[i-1]&&a[i]>a[i+1]){
    pos=i;
  }
}
return;
}
int max_towers(int L, int R, int D) {
if(pos-1>=R){
  return 1;
}
if(pos-1<=L){
  return 1;
}
if(a[L+1]<=a[pos]-D&&a[R+1]<=a[pos]-D){
  return 2;
}else return 1;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 379 ms 936 KB Output is correct
2 Correct 876 ms 1360 KB Output is correct
3 Correct 518 ms 1456 KB Output is correct
4 Correct 787 ms 1472 KB Output is correct
5 Correct 506 ms 1448 KB Output is correct
6 Correct 637 ms 1360 KB Output is correct
7 Correct 776 ms 1448 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Correct 0 ms 208 KB Output is correct
10 Correct 1 ms 208 KB Output is correct

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 208 KB 1st lines differ - on the 1st token, expected: '13', found: '1'
2 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 208 KB 1st lines differ - on the 1st token, expected: '13', found: '1'
2 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 440 ms 1472 KB 1st lines differ - on the 1st token, expected: '11903', found: '1'
2 Halted 0 ms 0 KB -

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 171 ms 552 KB 1st lines differ - on the 1st token, expected: '7197', found: '2'
2 Halted 0 ms 0 KB -

Subtask #6
0 / 19.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 208 KB 1st lines differ - on the 1st token, expected: '13', found: '1'
2 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 379 ms 936 KB Output is correct
2 Correct 876 ms 1360 KB Output is correct
3 Correct 518 ms 1456 KB Output is correct
4 Correct 787 ms 1472 KB Output is correct
5 Correct 506 ms 1448 KB Output is correct
6 Correct 637 ms 1360 KB Output is correct
7 Correct 776 ms 1448 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Correct 0 ms 208 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Incorrect 0 ms 208 KB 1st lines differ - on the 1st token, expected: '13', found: '1'
12 Halted 0 ms 0 KB -