oj.uz

Submission #69065

# Submission time Handle Problem Language Result Execution time Memory
69065 2018-08-19T18:11:03 Z Kubalionzzale Roller Coaster Railroad (IOI16_railroad) C++14
0 / 100
 248 ms 22344 KB 
#include "railroad.h"

#include <iostream>
#include <algorithm>
#include <functional>
#include <set>
#include <map>

int n;
std::pair<int, int> a[200010];
std::multiset< int, std::greater<int> > set;
//first - output speed, second - index

bool compare(const std::pair<int, int> &lhs, const std::pair<int, int> &rhs)
{
  if (lhs.first != rhs.first)
    return lhs.first < rhs.first;
  else
    return lhs.second < rhs.second;
}

long long plan_roller_coaster(std::vector<int> s, std::vector<int> t) {
  n = (int) s.size();

  for (int i = 0; i < n; ++i)
  {
    a[i].first = s[i];
    a[i].second = t[i];

    set.insert(a[i].second);
  }

  set.insert(1);

  std::sort(a, a + n, compare);
  bool flag = false;
  return 0;
  for (int i = 0; i < n; ++i)
  {
    if (set.find(a[i].second) != set.end())
      flag = true;

    if (flag)
      set.erase(set.find(a[i].second));
    auto it = set.lower_bound(a[i].first);

    if (it == set.end())
      return 1;

    set.erase(it);
    if (flag)
      set.insert(a[i].second);
  }

  return 0;
}

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 380 KB n = 2
2 Correct 2 ms 492 KB n = 2
3 Correct 2 ms 492 KB n = 2
4 Correct 2 ms 492 KB n = 2
5 Correct 2 ms 508 KB n = 2
6 Incorrect 2 ms 564 KB answer is not correct: 0 instead of 523688153
7 Halted 0 ms 0 KB -

Subtask #2
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 380 KB n = 2
2 Correct 2 ms 492 KB n = 2
3 Correct 2 ms 492 KB n = 2
4 Correct 2 ms 492 KB n = 2
5 Correct 2 ms 508 KB n = 2
6 Incorrect 2 ms 564 KB answer is not correct: 0 instead of 523688153
7 Halted 0 ms 0 KB -

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 237 ms 18540 KB n = 199999
2 Incorrect 248 ms 22344 KB answer is not correct: 0 instead of 1
3 Halted 0 ms 0 KB -

Subtask #4
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 380 KB n = 2
2 Correct 2 ms 492 KB n = 2
3 Correct 2 ms 492 KB n = 2
4 Correct 2 ms 492 KB n = 2
5 Correct 2 ms 508 KB n = 2
6 Incorrect 2 ms 564 KB answer is not correct: 0 instead of 523688153
7 Halted 0 ms 0 KB -