oj.uz

답안 #1071738

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1071738 2024-08-23T10:40:32 Z beaconmc 송신탑 (IOI22_towers) C++17
4 / 100
 681 ms 1596 KB 
#include "towers.h"

 
#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
#define FOR(i,x,y) for(ll i=x; i<y; i++)
#define FORNEG(i,x,y) for(ll i=x; i>y; i--)

int maxi = 0;
vector<int> towers;
int maxpos = -1;

void init(int N, std::vector<int> H) {
    towers = H;
    FOR(i,0,N){
        maxi = max(maxi, H[i]);
    }
    FOR(i,0,N){
        if (H[i] == maxi) maxpos = i;
    }

}

int max_towers(int L, int R, int D) {
    if (L==R) return 1;

    if (maxi - towers[L] >= D && maxi - towers[R] >= D && L<=maxpos && R >= maxpos){
        return 2;
    }else{
        return 1;
    }
}

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 319 ms 1112 KB Output is correct
2 Correct 643 ms 1368 KB Output is correct
3 Correct 679 ms 1368 KB Output is correct
4 Correct 627 ms 1592 KB Output is correct
5 Correct 681 ms 1368 KB Output is correct
6 Correct 612 ms 1368 KB Output is correct
7 Correct 619 ms 1368 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 1 ms 344 KB Output is correct

Subtask #2
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 344 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 1 ms 344 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 457 ms 1596 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 225 ms 688 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 1 ms 344 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 319 ms 1112 KB Output is correct
2 Correct 643 ms 1368 KB Output is correct
3 Correct 679 ms 1368 KB Output is correct
4 Correct 627 ms 1592 KB Output is correct
5 Correct 681 ms 1368 KB Output is correct
6 Correct 612 ms 1368 KB Output is correct
7 Correct 619 ms 1368 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Incorrect 1 ms 344 KB 1st lines differ - on the 1st token, expected: '13', found: '1'
12 Halted 0 ms 0 KB -