oj.uz

답안 #480720

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
480720 2021-10-18T00:56:18 Z MonkeyKing Semiexpress (JOI17_semiexpress) C++14
100 / 100
 35 ms 336 KB 
#include <numeric>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <string.h>
#include <stack>
#include <assert.h>
#include <bitset>
#include <time.h>
#define Endl endl
#define mp make_pair
#define mt make_tuple
#define ll long long 
#define ull unsigned long long
#define pii pair<int,int>
#define over(A) {cout<<A<<endl;exit(0);}
#define all(A) A.begin(),A.end()
#define quickcin ios_base::sync_with_stdio(false);
const int mod=1000000007;
const int gmod=3;
const int inf=1039074182;
const double eps=1e-9;
const double pi=3.141592653589793238462643383279;
const ll llinf=2LL*inf*inf;
template <typename T1,typename T2> inline void chmin(T1 &x,T2 b) {if(b<x) x=b;}
template <typename T1,typename T2> inline void chmax(T1 &x,T2 b) {if(b>x) x=b;}
inline void chadd(int &x,int b) {x+=b-mod;x+=(x>>31 & mod);}
template <typename T1,typename T2> inline void chadd(T1 &x,T2 b) {x+=b;if(x>=mod) x-=mod;}
template <typename T1,typename T2> inline void chmul(T1 &x,T2 b) {x=1LL*x*b%mod;}
template <typename T1,typename T2> inline void chmod(T1 &x,T2 b) {x%=b,x+=b;if(x>=b) x-=b;}
template <typename T> inline T mabs(T x) {return (x<0?-x:x);}
using namespace std;
int n,m,k;
ll a,b,c;
ll T;
int dp[3005][3005];
int s[3005];
int rm[3005];
ll t[3005];

inline int calc(int rm,ll t)
{
	if(t>T) return 0;
	return max(0LL,min((ll)rm,(T-t)/a+1));
}

inline int calc2(int rm,ll t)
{
	int steps=calc(rm,t);
	return calc(rm-steps,t+steps*c);
}

int main()
{
	// freopen("input.txt","r",stdin);
	// freopen("car.in","r",stdin);
	// freopen("car.out","w",stdout);
	cin>>n>>m>>k>>a>>b>>c>>T;
	for(int i=0;i<m;i++) scanf("%d",s+i),s[i]--;
	k-=m;
	m--;
	for(int i=0;i<m;i++) rm[i]=s[i+1]-s[i];
	for(int i=0;i<m;i++) t[i]=s[i]*b;
	while(k--)
	{
		int ch=0;
		for(int i=1;i<m;i++)
		{
			if(calc2(rm[ch],t[ch])<calc2(rm[i],t[i])) ch=i;
		}
		// if(ch==1) cout<<rm[1]<<','<<t[1]<<endl;
		int steps=calc(rm[ch],t[ch]);
		rm[ch]-=steps;
		t[ch]+=steps*c;
	}
	ll ans=n;
	for(int i=0;i<m;i++) ans-=rm[i]-calc(rm[i],t[i]);
	ans--;
	ans-=(b*(n-1)>T);
	cout<<ans<<endl;
	return 0;
}

Compilation message

semiexpress.cpp: In function 'int main()':
semiexpress.cpp:66:28: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   66 |  for(int i=0;i<m;i++) scanf("%d",s+i),s[i]--;
      |                       ~~~~~^~~~~~~~~~

Subtask #1
18.0 / 18.0

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

Subtask #2
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 256 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct

Subtask #3
52.0 / 52.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 256 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 16 ms 332 KB Output is correct
20 Correct 35 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 4 ms 332 KB Output is correct
23 Correct 32 ms 336 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 8 ms 312 KB Output is correct
30 Correct 5 ms 204 KB Output is correct