답안 #902691

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
902691	2024-01-11T00:18:38 Z	AdamGS	Roller Coaster Railroad (IOI16_railroad)	C++17	11 / 100	2000 ms	8000 KB

railroad

#include "railroad.h"
#include<bits/stdc++.h>
using namespace std;
typedef long double ld;
typedef long long ll;
#define rep(a, b) for(int a = 0; a < (b); ++a)
#define st first
#define nd second
#define pb push_back
#define all(a) a.begin(), a.end()
const ll INF=1e18+7;
ll plan_roller_coaster(vector<int>S, vector<int>T) {
  int n=S.size();
  vector<int>V(n);
  rep(i, n) V[i]=i;
  ll ans=INF;
  do {
    ll sum=0;
    rep(i, n-1) sum+=max((ll)T[V[i]]-(ll)S[V[i+1]], 0ll);
    ans=min(ans, sum);
  } while(next_permutation(all(V)));
  return ans;
}

Subtask #1

11.0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	352 KB	n = 2
2	Correct	0 ms	348 KB	n = 2
3	Correct	0 ms	348 KB	n = 2
4	Correct	1 ms	360 KB	n = 2
5	Correct	0 ms	360 KB	n = 2
6	Correct	0 ms	360 KB	n = 2
7	Correct	1 ms	360 KB	n = 3
8	Correct	0 ms	360 KB	n = 3
9	Correct	1 ms	504 KB	n = 3
10	Correct	1 ms	344 KB	n = 8
11	Correct	1 ms	348 KB	n = 8
12	Correct	1 ms	348 KB	n = 8
13	Correct	1 ms	348 KB	n = 8
14	Correct	1 ms	348 KB	n = 8
15	Correct	1 ms	348 KB	n = 8
16	Correct	1 ms	348 KB	n = 8
17	Correct	1 ms	596 KB	n = 8
18	Correct	1 ms	360 KB	n = 8
19	Correct	0 ms	444 KB	n = 3
20	Correct	0 ms	360 KB	n = 7
21	Correct	1 ms	360 KB	n = 8
22	Correct	1 ms	360 KB	n = 8
23	Correct	1 ms	612 KB	n = 8
24	Correct	1 ms	360 KB	n = 8
25	Correct	1 ms	360 KB	n = 8

Subtask #2

0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	352 KB	n = 2
2	Correct	0 ms	348 KB	n = 2
3	Correct	0 ms	348 KB	n = 2
4	Correct	1 ms	360 KB	n = 2
5	Correct	0 ms	360 KB	n = 2
6	Correct	0 ms	360 KB	n = 2
7	Correct	1 ms	360 KB	n = 3
8	Correct	0 ms	360 KB	n = 3
9	Correct	1 ms	504 KB	n = 3
10	Correct	1 ms	344 KB	n = 8
11	Correct	1 ms	348 KB	n = 8
12	Correct	1 ms	348 KB	n = 8
13	Correct	1 ms	348 KB	n = 8
14	Correct	1 ms	348 KB	n = 8
15	Correct	1 ms	348 KB	n = 8
16	Correct	1 ms	348 KB	n = 8
17	Correct	1 ms	596 KB	n = 8
18	Correct	1 ms	360 KB	n = 8
19	Correct	0 ms	444 KB	n = 3
20	Correct	0 ms	360 KB	n = 7
21	Correct	1 ms	360 KB	n = 8
22	Correct	1 ms	360 KB	n = 8
23	Correct	1 ms	612 KB	n = 8
24	Correct	1 ms	360 KB	n = 8
25	Correct	1 ms	360 KB	n = 8
26	Correct	1 ms	360 KB	n = 8
27	Correct	1 ms	360 KB	n = 8
28	Correct	1 ms	360 KB	n = 8
29	Execution timed out	2055 ms	360 KB	Time limit exceeded
30	Halted	0 ms	0 KB	-

Subtask #3

0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Execution timed out	2100 ms	8000 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #4

0 / 36.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	352 KB	n = 2
2	Correct	0 ms	348 KB	n = 2
3	Correct	0 ms	348 KB	n = 2
4	Correct	1 ms	360 KB	n = 2
5	Correct	0 ms	360 KB	n = 2
6	Correct	0 ms	360 KB	n = 2
7	Correct	1 ms	360 KB	n = 3
8	Correct	0 ms	360 KB	n = 3
9	Correct	1 ms	504 KB	n = 3
10	Correct	1 ms	344 KB	n = 8
11	Correct	1 ms	348 KB	n = 8
12	Correct	1 ms	348 KB	n = 8
13	Correct	1 ms	348 KB	n = 8
14	Correct	1 ms	348 KB	n = 8
15	Correct	1 ms	348 KB	n = 8
16	Correct	1 ms	348 KB	n = 8
17	Correct	1 ms	596 KB	n = 8
18	Correct	1 ms	360 KB	n = 8
19	Correct	0 ms	444 KB	n = 3
20	Correct	0 ms	360 KB	n = 7
21	Correct	1 ms	360 KB	n = 8
22	Correct	1 ms	360 KB	n = 8
23	Correct	1 ms	612 KB	n = 8
24	Correct	1 ms	360 KB	n = 8
25	Correct	1 ms	360 KB	n = 8
26	Correct	1 ms	360 KB	n = 8
27	Correct	1 ms	360 KB	n = 8
28	Correct	1 ms	360 KB	n = 8
29	Execution timed out	2055 ms	360 KB	Time limit exceeded
30	Halted	0 ms	0 KB	-