제출 #438448

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
438448		adamjinwei	선물상자 (IOI15_boxes)	C++14	10 / 100	1 ms	204 KiB

boxes

#include <bits/stdc++.h>
#include "boxes.h"
#define inf 1000000007
#define mod 1000000007
#define rnd() rand_num()
#define bigrnd() dis(rand_num)
//#pragma GCC optimize("Ofast","inline","-ffast-math")
//#pragma GCC target("avx,sse2,sse3,sse4,mmx")
//#define int long long
using namespace std;
unsigned sed=std::chrono::system_clock::now().time_since_epoch().count();
mt19937 rand_num(sed);
uniform_int_distribution<long long> dis(0,inf);
template <typename T> void read(T &x){
	x=0;char ch=getchar();int fh=1;
	while (ch<'0'||ch>'9'){if (ch=='-')fh=-1;ch=getchar();}
	while (ch>='0'&&ch<='9')x=x*10+ch-'0',ch=getchar();
	x*=fh;
}
template <typename T> void write(T x) {
	if (x<0) x=-x,putchar('-');
	if (x>9) write(x/10);
	putchar(x%10+'0');
}
template <typename T> void writeln(T x) {
	write(x);
	puts("");
}
int n;
int pos[10000005];
long long delivery(int N,int K,int L,int positions[])
{
	n=N;
	for(int i=0;i<N;++i)
		if(positions[i]==0)
			n--;
	for(int i=1;i<=n;++i)
		pos[i]=positions[N-n+i-1];
	long long ans1=0;
	for(int i=1;i<=n;i+=K)
	{
		int l=pos[i],r=pos[min(n,i+K-1)];
		ans1+=min(min(L,2*r),min(L,2*(L-l)));
	}
	long long ans2=0;
	for(int i=n;i>=1;i-=K)
	{
		int l=pos[max(1,i-K+1)],r=pos[i];
		ans2+=min(min(L,2*r),min(L,2*(L-l)));
	}
	return min(ans1,ans2);
}

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

boxes.cpp:11:71: warning: conversion from 'std::chrono::duration<long int, std::ratio<1, 1000000000> >::rep' {aka 'long int'} to 'unsigned int' may change value [-Wconversion]
   11 | unsigned sed=std::chrono::system_clock::now().time_since_epoch().count();
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~

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