oj.uz

Submission #838133

# Submission time Handle Problem Language Result Execution time Memory
838133 2023-08-26T09:11:06 Z Dremix10 Radio Towers (IOI22_towers) C++17
4 / 100
 796 ms 1480 KB 
#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;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 391 ms 976 KB Output is correct
2 Correct 796 ms 1436 KB Output is correct
3 Correct 530 ms 1360 KB Output is correct
4 Correct 550 ms 1436 KB Output is correct
5 Correct 717 ms 1444 KB Output is correct
6 Correct 582 ms 1480 KB Output is correct
7 Correct 549 ms 1456 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Correct 0 ms 208 KB Output is correct
10 Correct 0 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 325 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 193 ms 556 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 391 ms 976 KB Output is correct
2 Correct 796 ms 1436 KB Output is correct
3 Correct 530 ms 1360 KB Output is correct
4 Correct 550 ms 1436 KB Output is correct
5 Correct 717 ms 1444 KB Output is correct
6 Correct 582 ms 1480 KB Output is correct
7 Correct 549 ms 1456 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Correct 0 ms 208 KB Output is correct
10 Correct 0 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 -