oj.uz

Submission #902214

# Submission time Handle Problem Language Result Execution time Memory
902214 2024-01-10T07:12:27 Z nguyentunglam Roller Coaster Railroad (IOI16_railroad) C++17
11 / 100
 2000 ms 8132 KB 
#include<bits/stdc++.h>
#define fi first
#define se second
#define endl "\n"
#define ii pair<int, int>
using namespace std;

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

  vector<int> order(n);

  for(int i = 0; i < n; i++) order[i] = i;

  auto check = [&] () {
    long long ret = 0;
    for(long long cur = 0, speed = 1; cur < n; cur++) {
      int i = order[cur];
      ret += max(0LL, speed - s[i]);
      speed = t[i];
    }
    return ret;
  };

  long long ans = 1e18;

  do {
    ans = min(ans, check());
  } while (next_permutation(order.begin(), order.begin() + n));

  return ans;
}


#ifdef ngu
int main() {

  freopen ("task.inp", "r", stdin);
  freopen ("task.out", "w", stdout);

  int n; cin >> n;
  vector<int> s(n), t(n);
  for(int i = 0; i < n; i++) cin >> s[i] >> t[i];


  cout << plan_roller_coaster(s, t);
}
#endif // ngu

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB n = 2
2 Correct 0 ms 348 KB n = 2
3 Correct 0 ms 348 KB n = 2
4 Correct 1 ms 348 KB n = 2
5 Correct 1 ms 348 KB n = 2
6 Correct 0 ms 360 KB n = 2
7 Correct 0 ms 360 KB n = 3
8 Correct 1 ms 360 KB n = 3
9 Correct 1 ms 360 KB n = 3
10 Correct 1 ms 768 KB n = 8
11 Correct 1 ms 360 KB n = 8
12 Correct 1 ms 360 KB n = 8
13 Correct 1 ms 364 KB n = 8
14 Correct 1 ms 360 KB n = 8
15 Correct 1 ms 348 KB n = 8
16 Correct 1 ms 352 KB n = 8
17 Correct 1 ms 348 KB n = 8
18 Correct 1 ms 348 KB n = 8
19 Correct 0 ms 348 KB n = 3
20 Correct 1 ms 436 KB n = 7
21 Correct 1 ms 348 KB n = 8
22 Correct 1 ms 428 KB n = 8
23 Correct 1 ms 348 KB n = 8
24 Correct 1 ms 348 KB n = 8
25 Correct 1 ms 344 KB n = 8

Subtask #2
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB n = 2
2 Correct 0 ms 348 KB n = 2
3 Correct 0 ms 348 KB n = 2
4 Correct 1 ms 348 KB n = 2
5 Correct 1 ms 348 KB n = 2
6 Correct 0 ms 360 KB n = 2
7 Correct 0 ms 360 KB n = 3
8 Correct 1 ms 360 KB n = 3
9 Correct 1 ms 360 KB n = 3
10 Correct 1 ms 768 KB n = 8
11 Correct 1 ms 360 KB n = 8
12 Correct 1 ms 360 KB n = 8
13 Correct 1 ms 364 KB n = 8
14 Correct 1 ms 360 KB n = 8
15 Correct 1 ms 348 KB n = 8
16 Correct 1 ms 352 KB n = 8
17 Correct 1 ms 348 KB n = 8
18 Correct 1 ms 348 KB n = 8
19 Correct 0 ms 348 KB n = 3
20 Correct 1 ms 436 KB n = 7
21 Correct 1 ms 348 KB n = 8
22 Correct 1 ms 428 KB n = 8
23 Correct 1 ms 348 KB n = 8
24 Correct 1 ms 348 KB n = 8
25 Correct 1 ms 344 KB n = 8
26 Correct 1 ms 348 KB n = 8
27 Correct 1 ms 348 KB n = 8
28 Correct 1 ms 348 KB n = 8
29 Execution timed out 2071 ms 348 KB Time limit exceeded
30 Halted 0 ms 0 KB -

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2008 ms 8132 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB n = 2
2 Correct 0 ms 348 KB n = 2
3 Correct 0 ms 348 KB n = 2
4 Correct 1 ms 348 KB n = 2
5 Correct 1 ms 348 KB n = 2
6 Correct 0 ms 360 KB n = 2
7 Correct 0 ms 360 KB n = 3
8 Correct 1 ms 360 KB n = 3
9 Correct 1 ms 360 KB n = 3
10 Correct 1 ms 768 KB n = 8
11 Correct 1 ms 360 KB n = 8
12 Correct 1 ms 360 KB n = 8
13 Correct 1 ms 364 KB n = 8
14 Correct 1 ms 360 KB n = 8
15 Correct 1 ms 348 KB n = 8
16 Correct 1 ms 352 KB n = 8
17 Correct 1 ms 348 KB n = 8
18 Correct 1 ms 348 KB n = 8
19 Correct 0 ms 348 KB n = 3
20 Correct 1 ms 436 KB n = 7
21 Correct 1 ms 348 KB n = 8
22 Correct 1 ms 428 KB n = 8
23 Correct 1 ms 348 KB n = 8
24 Correct 1 ms 348 KB n = 8
25 Correct 1 ms 344 KB n = 8
26 Correct 1 ms 348 KB n = 8
27 Correct 1 ms 348 KB n = 8
28 Correct 1 ms 348 KB n = 8
29 Execution timed out 2071 ms 348 KB Time limit exceeded
30 Halted 0 ms 0 KB -