oj.uz

답안 #1056988

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1056988 2024-08-13T12:51:57 Z mychecksedad 송신탑 (IOI22_towers) C++17
14 / 100
 537 ms 6528 KB 
#include "towers.h"
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define all(x) x.begin(),x.end()
#define ll long long int
#define en cout << '\n'
#define pi pair<int,int>
#define vi vector<int> 
#define ff first
#define ss second

struct Fenwick{
  vector<int> t;
  int n;
  Fenwick(int n): n(n){
    t.resize(n+1);
  }
  void add(int v){
    while(v <= n){
      t[v]++;
      v += v&-v;
    }
  }
  int get(int v){
    int res = 0;
    while(v > 0){
      res += t[v];
      v -= v&-v;
    }
    return res;
  }
};


void op(vector<int> &a, vector<int> &A, vector<int> &B){
  if(a.size() <= 1){
    A = a;
    B.pb(0);
    return;
  }
  A.pb(a[0]);
  A.pb(a[1]);
  B.pb(0);
  B.pb(1);
  for(int i = 2; i < a.size(); ++i){
    if(a[i] > A.back() && A.back() > A[int(A.size()) - 2]){
      A.pop_back();
      B.pop_back();
      A.pb(a[i]);
      B.pb(i);
    }else if(a[i] < A.back() && A.back() < A[int(A.size()) - 2]){
      A.pop_back();
      B.pop_back();
      A.pb(a[i]);
      B.pb(i);
    }else{
      A.pb(a[i]);
      B.pb(i);
    }
  }
  
}
int n;
vector<int> A, B, A2, A1, B1, B2, a;
Fenwick f(1000000);
void init(int nn, std::vector<int> aa) { n=nn;a=aa;
  if(n == 1) return;
  op(a, A, B);
  // elimizde a b var cool
  // if(A[0] > A[1]){
  //   for(int i = 0; i < A.size(); i += 2){
  //     f.add(B[i]);
  //   }
  // }else{
  //   for(int i = 1; i < A.size(); i += 2){
  //     f.add(B[i]);
  //   }
  // }
  for(int i = 1; i + 1 < n; ++i){
    if(a[i] > a[i - 1] && a[i] > a[i + 1]) f.add(i + 1);
  }
}

int max_towers(int L, int R, int D) { ++L, ++R;
  if(n == 1 || L == R) return 1;
  return max(f.get(R-1) - f.get(L) + 1, 1);
}

Compilation message

towers.cpp: In function 'void op(std::vector<int>&, std::vector<int>&, std::vector<int>&)':
towers.cpp:46:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   46 |   for(int i = 2; i < a.size(); ++i){
      |                  ~~^~~~~~~~~~

Subtask #1
0 / 4.0

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

Subtask #2
0 / 11.0

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

Subtask #3
0 / 12.0

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

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 384 ms 6356 KB Output is correct
2 Correct 521 ms 6356 KB Output is correct
3 Correct 441 ms 6356 KB Output is correct
4 Correct 513 ms 6356 KB Output is correct
5 Correct 537 ms 6356 KB Output is correct
6 Correct 495 ms 6356 KB Output is correct
7 Correct 519 ms 6356 KB Output is correct
8 Correct 537 ms 5464 KB Output is correct
9 Correct 498 ms 5464 KB Output is correct
10 Correct 496 ms 5464 KB Output is correct
11 Correct 536 ms 5464 KB Output is correct
12 Correct 511 ms 5464 KB Output is correct
13 Correct 483 ms 5464 KB Output is correct
14 Correct 1 ms 4184 KB Output is correct
15 Correct 1 ms 4184 KB Output is correct
16 Correct 1 ms 4184 KB Output is correct
17 Correct 16 ms 6404 KB Output is correct
18 Correct 9 ms 6356 KB Output is correct
19 Correct 9 ms 6480 KB Output is correct
20 Correct 8 ms 5380 KB Output is correct
21 Correct 8 ms 5464 KB Output is correct
22 Correct 9 ms 6356 KB Output is correct
23 Correct 10 ms 6356 KB Output is correct
24 Correct 9 ms 6528 KB Output is correct
25 Correct 8 ms 5464 KB Output is correct
26 Correct 8 ms 5384 KB Output is correct
27 Correct 1 ms 4184 KB Output is correct
28 Correct 1 ms 4184 KB Output is correct
29 Correct 1 ms 4184 KB Output is correct
30 Correct 2 ms 4184 KB Output is correct
31 Correct 1 ms 4184 KB Output is correct
32 Correct 1 ms 4184 KB Output is correct
33 Correct 1 ms 4184 KB Output is correct
34 Correct 2 ms 4184 KB Output is correct
35 Correct 1 ms 4184 KB Output is correct
36 Correct 1 ms 4184 KB Output is correct

Subtask #5
0 / 17.0

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

Subtask #6
0 / 19.0

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

Subtask #7
0 / 23.0

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