oj.uz

답안 #30544

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
30544 2017-07-24T14:27:20 Z kavun 선물상자 (IOI15_boxes) C++14
25 / 100
 3 ms 424 KB 
#include "boxes.h"
#include <bits/stdc++.h>
#define pb push_back

using namespace std;
long long n,l,k,ans = 1e18, cw[10000010], ccw[10000010], lmid = -1, rmid = -1;


long long delivery(int N, int K, int L, int p[]) {
  n = N;
  k = K;
  for(int i = 0; i < n; i++)
    {
      if(p[i] <= L/2)
	lmid = i;
      if(p[i] > L/2)
	{
	  rmid = i;
	  break;
	}
    }
  for(int i = 0; i < k; i++)
    cw[i] = 2*p[i];
  for(int i = k; i < n; i++)
    cw[i] = cw[i-k] + 2*p[i];
  for(int i = n-1; i >= n-k; i--)
    ccw[i] = 2*(L-p[i]);
  for(int i = n-k-1; i >= 0; i--)
    ccw[i] = ccw[i+k] + 2*(L-p[i]);
  for(int i = 0; i < n; i++)
    {
      if(i + k >= n-1)
	ans = min(ans,cw[i] + L);
      else if(p[i+k] > L/2)
	ans = min(ans,cw[i] + L + 2*ccw[i+k+1]);
    }
  long long ans2 = 0;
  if(lmid > -1)
    ans2 += cw[lmid];
  if(rmid > -1)
    ans2 += ccw[rmid];
  ans = min(ans,ans2);

  return ans;
}

Compilation message

boxes.cpp: In function 'long long int delivery(int, int, int, int*)':
boxes.cpp:24:15: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
   for(int i = k; i < n; i++)
               ^
boxes.cpp:26:16: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
   for(int i = n-1; i >= n-k; i--)
               ~^~
boxes.cpp:28:18: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
   for(int i = n-k-1; i >= 0; i--)
               ~~~^~

Subtask #1
10.0 / 10.0

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

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 380 KB Output is correct
4 Incorrect 2 ms 376 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 352 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Correct 2 ms 424 KB Output is correct
8 Correct 2 ms 256 KB Output is correct

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 2 ms 292 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 292 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 380 KB Output is correct
11 Incorrect 2 ms 376 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 2 ms 292 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 292 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 380 KB Output is correct
11 Incorrect 2 ms 376 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 2 ms 292 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 292 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 380 KB Output is correct
11 Incorrect 2 ms 376 KB Output isn't correct
12 Halted 0 ms 0 KB -