oj.uz

답안 #671757

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
671757 2022-12-13T17:31:24 Z Hacv16 코끼리 (Dancing Elephants) (IOI11_elephants) C++17
0 / 100
 1 ms 340 KB 
#include "elephants.h"
#include<bits/stdc++.h>

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
 
using namespace std;
 
#define all(x) x.begin(), x.end()
#define sz(x) (int) x.size()

typedef long long ll;
const int MAX = 2e6 + 15;
 
int n, L, X[] = {10, 15, 17, 20};
vector<int> x;
 
void init(int n_, int l_, int x_[]){
  n = n_, L = l_;
  x.resize(n);
 
  for(int i = 0; i < n; i++)
     x[i] = x_[i];
}

vector<int> Merge(vector<int>& v, vector<int>& t){
  vector<int> ret(sz(v) + sz(t));
  merge(all(v), all(t), ret.begin());
  return ret;
}
 
int update(int i, int y){
  vector<int> l, r, m;
  m.push_back(y);

  for(int j = 0; j < i; j++)
      l.push_back(x[j]);

  for(int j = i + 1; j < sz(x); j++)
      r.push_back(x[j]);

  vector<int> aux1 = Merge(l, m);
  vector<int> aux2 = Merge(aux1, r);

  swap(x, aux2);

  int ans = 0;

  for(int j = 0, t = -1; j < x.size(); j++)
    if(x[j] > t) ans++, t = x[j] + L;
 
  return ans;
}

/*int main(){
  init(4, 10, X);

  cout << update(2, 16) << '\n';
  cout << update(1, 25) << '\n';
  cout << update(3, 35) << '\n';
  cout << update(0, 38) << '\n';
  cout << update(2, 0) << '\n';

  return 0;
}*/

Compilation message

elephants.cpp: In function 'int update(int, int)':
elephants.cpp:49:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   49 |   for(int j = 0, t = -1; j < x.size(); j++)
      |                          ~~^~~~~~~~~~

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 47.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -