oj.uz

Submission #50173

# Submission time Handle Problem Language Result Execution time Memory
50173 2018-06-08T06:51:50 Z Just_Solve_The_Problem Wall (IOI14_wall) C++11
8 / 100
 914 ms 209888 KB 
#include <bits/stdc++.h>
#include "wall.h"

#define pb push_back
#define eb emplace_back
#define ll long long
#define pii pair < int, int >
#define fr first
#define sc second
#define mk make_pair
#define sz(s) (int)s.size()
#define all(s) s.begin(), s.end()
#define ok puts("ok");
#define whatis(x) cerr << #x << " = " << x << endl;
#define pause system("pause");
#define random (rand() ^ (rand() << 15))

using namespace std;

const int N = (int)2e6 + 7;

int n;
set < int > in[N], er[N];
int a[N];

void buildWall(int nn, int k, int op[], int left[], int right[], int height[], int finalHeight[]){
  n = nn;
  if (n <= 10000) {
    for (int i = 0; i < k; i++) {
      for (int j = left[i]; j <= right[i]; j++) {
        if (op[i] == 1) {
          a[j] = max(a[j], height[i]);
        } else {
          a[j] = min(a[j], height[i]);
        }
      }
    }
    for (int i = 0; i < n; i++) {
      finalHeight[i] = a[i];
    }
    return ;
  }
  for (int i = 0; i < k; i++) {
    if (op[i] == 2) break;
    in[left[i]].insert(height[i]);
    er[right[i] + 1].insert(height[i]);
  }
  set < int > cur;
  for (int i = 0; i < n; i++) {
    for (auto to : er[i])
      cur.erase(to);
    for (auto to : in[i])
      cur.insert(to);
    in[i].clear();
    er[i].clear();
    if (cur.empty()) continue;
    a[i] = *cur.rbegin();
  }
  cur.clear();
  for (int i = 0; i < k; i++) {
    if (op[i] == 1) continue;
    in[left[i]].insert(height[i]);
    er[right[i] + 1].insert(height[i]);
  }
  for (int i = 0; i < n; i++) {
    for (auto to : er[i])
      cur.erase(to);
    for (auto to : in[i])
      cur.insert(to);
    in[i].clear();
    er[i].clear();
    if (cur.empty()) continue;
    a[i] = min(*cur.begin(), a[i]);
  }

  for (int i = 0; i < n; i++) {
    finalHeight[i] = a[i];
  }
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 148 ms 188152 KB Output is correct
2 Correct 150 ms 188452 KB Output is correct
3 Correct 149 ms 188452 KB Output is correct
4 Correct 179 ms 188552 KB Output is correct
5 Correct 185 ms 188552 KB Output is correct
6 Correct 186 ms 188712 KB Output is correct

Subtask #2
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 169 ms 188712 KB Output is correct
2 Correct 354 ms 196360 KB Output is correct
3 Incorrect 906 ms 209888 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 151 ms 209888 KB Output is correct
2 Correct 163 ms 209888 KB Output is correct
3 Correct 163 ms 209888 KB Output is correct
4 Correct 180 ms 209888 KB Output is correct
5 Correct 180 ms 209888 KB Output is correct
6 Correct 179 ms 209888 KB Output is correct
7 Correct 156 ms 209888 KB Output is correct
8 Correct 359 ms 209888 KB Output is correct
9 Incorrect 914 ms 209888 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #4
0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 156 ms 209888 KB Output is correct
2 Correct 155 ms 209888 KB Output is correct
3 Correct 157 ms 209888 KB Output is correct
4 Correct 173 ms 209888 KB Output is correct
5 Correct 182 ms 209888 KB Output is correct
6 Correct 192 ms 209888 KB Output is correct
7 Correct 154 ms 209888 KB Output is correct
8 Correct 345 ms 209888 KB Output is correct
9 Incorrect 824 ms 209888 KB Output isn't correct
10 Halted 0 ms 0 KB -