답안 #905057

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
905057	2024-01-12T13:32:30 Z	VMaksimoski008	선물상자 (IOI15_boxes)	C++14	35 / 100	162 ms	516 KB

boxes

#include <bits/stdc++.h>
#include "boxes.h"

#define pb push_back
#define eb emplace_back
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define uniq(x) x.erase(unique(all(x)), x.end())
#define rall(x) x.rbegin(), x.rend()
//#define int long long

using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

const int mod = 1e9 + 7;
const int LOG = 20;
const int maxn = 1e5 + 5;
const double eps = 1e-9;

void setIO() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
}

ll delivery(int N, int K, int L, int pos[]) {
    if(K == 1) {
        ll ans = 0;

        for(int i=0; i<N; i++)
            ans += 2 * min(pos[i], L - pos[i]);

        return ans;
    }

    if(K == N) {
        set<int> s;
        for(int i=0; i<N; i++) s.insert(pos[i]);
        vector<int> p(all(s));
        
        ll ans = 0;
        int cnt = 0;
        int curr = 0;

        vector<bool> vis(sz(p), 0);

        while(cnt != sz(p)) {
            ll mn = 1e18;
            int pos = 0;

            for(int i=0; i<sz(p); i++) {
                if(vis[i]) continue;
                ll d = abs(p[i] - curr);
                if(L + curr - p[i] < d) d = L + curr - p[i];
                if(d < mn) {
                    mn = d;
                    pos = i;
                }
            }

            vis[pos] = 1;
            ans += mn;
            curr = p[pos];
            cnt++;
        }

        return ans + min(curr, L - curr);
    } 

    if(N <= 10) {
        vector<int> p;
        for(int i=0; i<N; i++) p.push_back(pos[i]);
        sort(all(p));

        ll ans = 1e18;

        do {
            ll res = 0;

            int curr = 0;
            for(int i=0; i<N; i++) {
                ll d = abs(p[i] - curr);
                if(L + curr - p[i] < d) d = L + curr - p[i];
                res += d;
                curr = p[i];
                if(i % K == K - 1) {
                    res += min(curr, L - curr);
                    curr = 0;
                }
            }

            res += min(curr, L - curr);
            ans = min(ans, res);
        } while(next_permutation(all(p)));

        return ans;
    }

    return 0;
}

Compilation message

boxes.cpp: In function 'll delivery(int, int, int, int*)':
boxes.cpp:54:17: warning: declaration of 'int pos' shadows a parameter [-Wshadow]
   54 |             int pos = 0;
      |                 ^~~
boxes.cpp:31:38: note: shadowed declaration is here
   31 | ll delivery(int N, int K, int L, int pos[]) {
      |                                  ~~~~^~~~~

Subtask #1
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	1 ms	516 KB	Output is correct
3	Correct	1 ms	348 KB	Output is correct
4	Correct	1 ms	344 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	1 ms	344 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct

Subtask #2
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	1 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	2 ms	348 KB	Output is correct
7	Correct	1 ms	344 KB	Output is correct

Subtask #3
15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	1 ms	348 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	1 ms	432 KB	Output is correct
6	Correct	160 ms	416 KB	Output is correct
7	Correct	162 ms	412 KB	Output is correct
8	Correct	159 ms	348 KB	Output is correct

Subtask #4
0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	1 ms	516 KB	Output is correct
3	Correct	1 ms	348 KB	Output is correct
4	Correct	1 ms	344 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	1 ms	344 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	2 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	2 ms	348 KB	Output is correct
14	Correct	1 ms	344 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	1 ms	348 KB	Output is correct
17	Correct	1 ms	348 KB	Output is correct
18	Correct	1 ms	348 KB	Output is correct
19	Correct	1 ms	432 KB	Output is correct
20	Correct	160 ms	416 KB	Output is correct
21	Correct	162 ms	412 KB	Output is correct
22	Correct	159 ms	348 KB	Output is correct
23	Correct	2 ms	348 KB	Output is correct
24	Incorrect	1 ms	348 KB	Output isn't correct
25	Halted	0 ms	0 KB	-

Subtask #5
0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	1 ms	516 KB	Output is correct
3	Correct	1 ms	348 KB	Output is correct
4	Correct	1 ms	344 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	1 ms	344 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	2 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	2 ms	348 KB	Output is correct
14	Correct	1 ms	344 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	1 ms	348 KB	Output is correct
17	Correct	1 ms	348 KB	Output is correct
18	Correct	1 ms	348 KB	Output is correct
19	Correct	1 ms	432 KB	Output is correct
20	Correct	160 ms	416 KB	Output is correct
21	Correct	162 ms	412 KB	Output is correct
22	Correct	159 ms	348 KB	Output is correct
23	Correct	2 ms	348 KB	Output is correct
24	Incorrect	1 ms	348 KB	Output isn't correct
25	Halted	0 ms	0 KB	-

Subtask #6
0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	1 ms	516 KB	Output is correct
3	Correct	1 ms	348 KB	Output is correct
4	Correct	1 ms	344 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	1 ms	344 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	2 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	2 ms	348 KB	Output is correct
14	Correct	1 ms	344 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	1 ms	348 KB	Output is correct
17	Correct	1 ms	348 KB	Output is correct
18	Correct	1 ms	348 KB	Output is correct
19	Correct	1 ms	432 KB	Output is correct
20	Correct	160 ms	416 KB	Output is correct
21	Correct	162 ms	412 KB	Output is correct
22	Correct	159 ms	348 KB	Output is correct
23	Correct	2 ms	348 KB	Output is correct
24	Incorrect	1 ms	348 KB	Output isn't correct
25	Halted	0 ms	0 KB	-

답안 #905057

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 10.0 / 10.0

Subtask #3 15.0 / 15.0

Subtask #4 0 / 15.0

Subtask #5 0 / 20.0

Subtask #6 0 / 30.0

Subtask #1
10.0 / 10.0

Subtask #2
10.0 / 10.0

Subtask #3
15.0 / 15.0

Subtask #4
0 / 15.0

Subtask #5
0 / 20.0

Subtask #6
0 / 30.0