oj.uz

답안 #1081939

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1081939 2024-08-30T13:03:28 Z farica 송신탑 (IOI22_towers) C++17
4 / 100
 4000 ms 5676 KB 
#include "towers.h"

#include <bits/stdc++.h>

using namespace std;

int n,sub1=1,idx=0;
vector<int> h;

void init(int N, vector<int> H) {
    h.clear();
    sub1 = 1;
    n = N;
    for(auto x : H)
        h.push_back(x);
    int ok=1;
    for(int i=0; i<H.size()-1; i++) {
        if(ok and H[i] > H[i+1]) {
            ok=0;
            idx = i;
        }
        if(!ok and H[i] < H[i+1])
            sub1=0;
    }
}

int max_towers(int L, int R, int D) {
    if(sub1) {
        if(idx > L and idx < R and (h[L]+D) <= h[idx] and (h[R]+D) <= h[idx])
            return 2;
        else
            return 1;
    }
    int ans=0;
    set<int>s;
    map<int,int>m;
    s.insert(max(h[L],h[L+1]));
    m[max(h[L], h[L+1])] = 1;
    for(int i=L+2; i<=R; i++) {
        auto it = s.lower_bound(h[i]+D);
        int new_ans = 0;
        if(it != s.end()) new_ans = m[*it]+1;
        m[h[i]] = ans;
        while(!s.empty() && *(s.begin()) < h[i]) s.erase(s.begin());
        s.insert(h[i]);
        ans = max(ans, new_ans);
    }
    return ans;
}

Compilation message

towers.cpp: In function 'void init(int, std::vector<int>)':
towers.cpp:17:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   17 |     for(int i=0; i<H.size()-1; i++) {
      |                  ~^~~~~~~~~~~

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 284 ms 1236 KB Output is correct
2 Correct 688 ms 1748 KB Output is correct
3 Correct 600 ms 1748 KB Output is correct
4 Correct 657 ms 1748 KB Output is correct
5 Correct 635 ms 1748 KB Output is correct
6 Correct 640 ms 1748 KB Output is correct
7 Correct 569 ms 1748 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 0 ms 344 KB 1st lines differ - on the 1st token, expected: '13', found: '15'
2 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

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

Subtask #4
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 4042 ms 5676 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 4010 ms 1624 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 19.0

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

Subtask #7
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 284 ms 1236 KB Output is correct
2 Correct 688 ms 1748 KB Output is correct
3 Correct 600 ms 1748 KB Output is correct
4 Correct 657 ms 1748 KB Output is correct
5 Correct 635 ms 1748 KB Output is correct
6 Correct 640 ms 1748 KB Output is correct
7 Correct 569 ms 1748 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 0 ms 344 KB 1st lines differ - on the 1st token, expected: '13', found: '15'
12 Halted 0 ms 0 KB -