oj.uz

답안 #825022

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
825022 2023-08-14T13:37:00 Z becaido 송신탑 (IOI22_towers) C++17
4 / 100
 793 ms 1476 KB 
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,popcnt,sse4,abm")
#include <bits/stdc++.h>
using namespace std;

#ifndef WAIMAI
#include "towers.h"
#endif

#ifdef WAIMAI
#define debug(HEHE...) cout << "[" << #HEHE << "] : ", dout(HEHE)
void dout() {cout << '\n';}
template<typename T, typename...U>
void dout(T t, U...u) {cout << t << (sizeof...(u) ? ", " : ""), dout(u...);}
#else
#define debug(...) 7122
#endif

#define ll long long
#define Waimai ios::sync_with_stdio(false), cin.tie(0)
#define FOR(x,a,b) for (int x = a, I = b; x <= I; x++)
#define pb emplace_back
#define F first
#define S second

const int SIZE = 1e5 + 5;

int n, k;
int a[SIZE];

void init(int N, vector<int> H) {
    n = N;
    FOR (i, 0, n - 1) a[i] = H[i];
    k = max_element(a, a + n) - a;
}

int max_towers(int L, int R, int D) {
    if (L < k && R > k && max(a[L], a[R]) <= a[k] - D) return 2;
    return 1;
}

/*
in1
7 3
10 20 60 40 50 30 70
1 5 10
2 2 100
0 6 17
out1
3
1
2
*/

#ifdef WAIMAI
int main() {
  int N, Q;
  assert(2 == scanf("%d %d", &N, &Q));
  vector<int> H(N);
  for (int i = 0; i < N; ++i) {
    assert(1 == scanf("%d", &H[i]));
  }
  init(N, H);

  for (int i = 0; i < Q; ++i) {
    int L, R, D;
    assert(3 == scanf("%d %d %d", &L, &R, &D));
    printf("%d\n", max_towers(L, R, D));
  }
  return 0;
}
#endif

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 293 ms 940 KB Output is correct
2 Correct 629 ms 1360 KB Output is correct
3 Correct 627 ms 1444 KB Output is correct
4 Correct 793 ms 1360 KB Output is correct
5 Correct 717 ms 1352 KB Output is correct
6 Correct 541 ms 1476 KB Output is correct
7 Correct 628 ms 1360 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

# 결과 실행 시간 메모리 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

# 결과 실행 시간 메모리 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

# 결과 실행 시간 메모리 Grader output
1 Incorrect 570 ms 1472 KB 1st lines differ - on the 1st token, expected: '11903', found: '2'
2 Halted 0 ms 0 KB -

Subtask #5
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 235 ms 464 KB 1st lines differ - on the 1st token, expected: '7197', found: '2'
2 Halted 0 ms 0 KB -

Subtask #6
0 / 19.0

# 결과 실행 시간 메모리 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

# 결과 실행 시간 메모리 Grader output
1 Correct 293 ms 940 KB Output is correct
2 Correct 629 ms 1360 KB Output is correct
3 Correct 627 ms 1444 KB Output is correct
4 Correct 793 ms 1360 KB Output is correct
5 Correct 717 ms 1352 KB Output is correct
6 Correct 541 ms 1476 KB Output is correct
7 Correct 628 ms 1360 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 -