oj.uz

Submission #1025040

# Submission time Handle Problem Language Result Execution time Memory
1025040 2024-07-16T14:35:40 Z mindiyak Dancing Elephants (IOI11_elephants) C++14
26 / 100
 9000 ms 3188 KB 
#include "elephants.h"
#pragma GCC optimize("O1,O2,O3,Ofast,unroll-loops")
#include <bits/stdc++.h>
#include <string>
#include <iostream>
#include <cmath>
#include <numeric>
#include <set>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<int, int> pl;
typedef pair<ld, ld> pd;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<vector<int>> vvi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
#define FOR(i, a, b) for (int i = a; i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define FORd(i, a, b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i, a) for (int i = (a)-1; i >= 0; i--)
#define trav(a, x) for (auto &a : x)
#define uid(a, b) uniform_int_distribution<int>(a, b)(rng)
#define len(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define F first
#define nl endl
#define S second
#define lb lower_bound
#define ub upper_bound
#define aint(x) x.begin(), x.end()
#define raint(x) x.rbegin(), x.rend()
#define ins insert
const int MOD = 1000000007;
 
int N,L;
int arr[1000000];
int idx[1000000];
 
void init(int n, int l, int X[])
{
  N=n;L=l;
  FOR(i,0,N){
    arr[i] = X[i];
    idx[i] = i;
  }
}
 
int update(int p, int y)
{
  int pos = 0;
  FOR(i,0,N){
    if(idx[i] == p){
      pos = i;
      break;
    }
  }

  arr[pos] = y;

  bool unsolved = true;
  while(unsolved){
    unsolved = false;
    FOR(i,0,N-1){
      if(arr[i]>arr[i+1]){
        swap(arr[i],arr[i+1]);
        swap(idx[i],idx[i+1]);
        unsolved = true;
      }
    }
  }

  int ans = 0,start = -1;
  FOR(i,0,N){
    if(ans == 0 || arr[i] > start+L){
      ans ++;
      start = arr[i];
    }
  }

  return ans;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct

Subtask #3
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 1429 ms 2096 KB Output is correct
8 Correct 1999 ms 2260 KB Output is correct
9 Correct 4059 ms 3188 KB Output is correct
10 Execution timed out 9019 ms 2904 KB Time limit exceeded
11 Halted 0 ms 0 KB -

Subtask #4
0 / 47.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 1429 ms 2096 KB Output is correct
8 Correct 1999 ms 2260 KB Output is correct
9 Correct 4059 ms 3188 KB Output is correct
10 Execution timed out 9019 ms 2904 KB Time limit exceeded
11 Halted 0 ms 0 KB -

Subtask #5
0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 1429 ms 2096 KB Output is correct
8 Correct 1999 ms 2260 KB Output is correct
9 Correct 4059 ms 3188 KB Output is correct
10 Execution timed out 9019 ms 2904 KB Time limit exceeded
11 Halted 0 ms 0 KB -