oj.uz

답안 #1056615

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1056615 2024-08-13T10:19:56 Z epicci23 송신탑 (IOI22_towers) C++17
14 / 100
 550 ms 3024 KB 
#include "bits/stdc++.h"
#include "towers.h"
//#define int long long
#define all(v) v.begin() , v.end()
#define sz(a) (int)a.size()
using namespace std;

vector<int> xd;
vector<int> bak;
void init(int n, vector<int> ar) {
  if(n<=2) return;
  vector<array<int,2>> v;
  bak=ar;
  if(ar[0]>ar[1]) v.push_back({ar[0],0});
  else {xd.push_back(0);v.push_back({ar[0],1});}
  for(int i=1;i<n-1;i++){
  	if(ar[i]>ar[i-1] && ar[i]>ar[i+1]) v.push_back({ar[i],0});
  	else if(ar[i]<ar[i-1] && ar[i]<ar[i+1]) {xd.push_back(i);v.push_back({ar[i],1});}
  }
  if(ar[n-1]<ar[n-2]) {xd.push_back(n-1);v.push_back({ar[n-1],1});}
  else v.push_back({ar[n-1],0});
}

int max_towers(int l, int r, int D){
  if(r-l<=1) return 1;
  int it=upper_bound(all(xd),r-1)-xd.begin();
  int it2=lower_bound(all(xd),l+1)-xd.begin();
  int cur=it-it2;
  if(bak[l]<bak[l+1]) cur++;
  if(bak[r]<bak[r-1]) cur++;
  return max(1,cur);
}

/*void _(){
  int n,q;cin >> n >> q;
  int ar[n+5];
  for(int i=1;i<=n;i++) cin >> ar[i];
  
  if(n<=2) return;

  vector<array<int,2>> v;
  vector<int> xd;
  if(ar[1]>ar[2]) v.push_back({ar[1],0});
  else {xd.push_back(1);v.push_back({ar[1],1});}
  for(int i=2;i<n;i++){
  	if(ar[i]>ar[i-1] && ar[i]>ar[i+1]) v.push_back({ar[i],0});
  	else if(ar[i]<ar[i-1] && ar[i]<ar[i+1]) {xd.push_back(i);v.push_back({ar[i],1});}
  }
  if(ar[n]<ar[n-1]) {xd.push_back(n);v.push_back({ar[n],1});}
  else v.push_back({ar[n],0});


  while(q--){
  	int l,r,d;
  	cin >> l >> r >> d;
  	int it=upper_bound(all(xd),r)-xd.begin();
  	int it2=lower_bound(all(xd),l)-xd.begin();
  	cout << it-it2 << '\n'; 
  }
}

int32_t main(){
  cin.tie(0); ios::sync_with_stdio(0);
  int tc=1;//cin >> tc;
  while(tc--) _();
  return 0;
}*/

Subtask #1
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 227 ms 1112 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 0 ms 344 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 0 ms 344 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 417 ms 2768 KB Output is correct
2 Correct 533 ms 3024 KB Output is correct
3 Correct 550 ms 2768 KB Output is correct
4 Correct 547 ms 3020 KB Output is correct
5 Correct 506 ms 3024 KB Output is correct
6 Correct 541 ms 3024 KB Output is correct
7 Correct 513 ms 3024 KB Output is correct
8 Correct 512 ms 1368 KB Output is correct
9 Correct 550 ms 1368 KB Output is correct
10 Correct 496 ms 1368 KB Output is correct
11 Correct 487 ms 1368 KB Output is correct
12 Correct 450 ms 1368 KB Output is correct
13 Correct 519 ms 1368 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 13 ms 2768 KB Output is correct
18 Correct 8 ms 3024 KB Output is correct
19 Correct 8 ms 3024 KB Output is correct
20 Correct 7 ms 1368 KB Output is correct
21 Correct 7 ms 1456 KB Output is correct
22 Correct 10 ms 3024 KB Output is correct
23 Correct 8 ms 3024 KB Output is correct
24 Correct 9 ms 2996 KB Output is correct
25 Correct 8 ms 1368 KB Output is correct
26 Correct 7 ms 1448 KB Output is correct
27 Correct 0 ms 344 KB Output is correct
28 Correct 0 ms 344 KB Output is correct
29 Correct 0 ms 344 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 0 ms 344 KB Output is correct
35 Correct 0 ms 344 KB Output is correct
36 Correct 0 ms 344 KB Output is correct

Subtask #5
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 121 ms 836 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 0 ms 344 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 227 ms 1112 KB 2nd lines differ - on the 1st token, expected: '1', found: '2'
2 Halted 0 ms 0 KB -