제출 #430941

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
430941		Emin2004	선물상자 (IOI15_boxes)	C++14	0 / 100	2089 ms	13644 KiB

boxes

#include "boxes.h"
#include <bits/stdc++.h>
using namespace std;

#define endl '\n'
#define pii pair <int, int>
#define pb push_back
#define F first
#define S second
#define ll long long
#define io ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define M_PI 3.14159265358979323846

const int N = 200005;
const int mod = 1e9 + 7;

vector<ll> a[N];
ll used[N], m, o, z;
ll ans = 0, res = LONG_MAX;

void DFS(ll node, int rem, int vis){
    used[node] = 1;
    ll cur = ans;
    if(vis == z){
        ans += min(node, m - node);
        res = min(res, ans);
    }
    else{
        ans += min(node, m - node);
        if(node != m) DFS(m, o, vis);
        if(rem == 0) {
            ans = cur;
            used[node] = 0;
            return;
        }
        for(int i : a[node]){
            if(!used[i]){
                ans = cur + min(abs(node - i), m - abs(node - i));
                DFS(i, rem - 1, vis + 1);
            }
        }
    }
    ans = cur;
    used[node] = 0;
}

long long delivery(int n, int k, int l, int p[]) {
    m = l;
    o = k;
    z = n;
    for(int i = 0; i < n; i++){
        a[m].pb(p[i]);
        for(int j = i + 1; j < n; j++){
            int x = p[i];
            int y = p[j];
            a[x].pb(y);
            a[y].pb(x);
        }
    }
    DFS(m, k, 0);
    return res;
}

컴파일 시 표준 에러 (stderr) 메시지

boxes.cpp: In function 'void DFS(long long int, int, int)':
boxes.cpp:30:30: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   30 |         if(node != m) DFS(m, o, vis);
      |                              ^
boxes.cpp:36:27: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   36 |         for(int i : a[node]){
      |                           ^

• Subtask 1: 0 / 10
• Subtask 2: 0 / 10
• Subtask 3: 0 / 15
• Subtask 4: 0 / 15
• Subtask 5: 0 / 20
• Subtask 6: 0 / 30