oj.uz

답안 #757267

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
757267 2023-06-12T22:19:23 Z Seb Roller Coaster Railroad (IOI16_railroad) C++17
11 / 100
 2000 ms 8476 KB 
#include "railroad.h"
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const ll INF = 1e10;

ll ans = INF;

bool vis[16];
vector <int> v,S,T;
ll n;

void checkeo() {
    ll aux=0;
    for (int i=1;i<n;i++) aux += max(T[v[i-1]]-S[v[i]],0);
    ans = min(ans,aux);
    return;
}

void bruta() {
    if (!v.empty() && v.size()==n) {
        checkeo();
        return;
    }
    for (int i=0;i<n;i++) if (vis[i]==false) {
        v.push_back(i);
        vis[i] = true;
        bruta();
        v.pop_back();
        vis[i] = false;
    }
    return;
}

long long plan_roller_coaster(std::vector<int> s, std::vector<int> t) {
    n = (int) s.size();
    swap(S,s);
    swap(T,t);
    bruta();
    return ans;
}

Compilation message

railroad.cpp: In function 'void bruta()':
railroad.cpp:24:31: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'll' {aka 'long long int'} [-Wsign-compare]
   24 |     if (!v.empty() && v.size()==n) {
      |                       ~~~~~~~~^~~

Subtask #1
11.0 / 11.0

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

Subtask #2
0 / 23.0

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

Subtask #3
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 495 ms 8476 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 36.0

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