Submission #442936

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
442936	2021-07-09T11:23:57 Z	Focutai	Global Warming (CEOI18_glo)	C++17	28 / 100	2000 ms	4556 KB

glo

#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define Fast_IO ios::sync_with_stdio(false);
#define DEBUG fprintf(stderr,"Running on Line %d in Function %s\n",__LINE__,__FUNCTION__)
//mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define fir first
#define sec second
#define mod 998244353
#define ll long long
#define inf 0x3f3f3f3f
#define INF 0x3f3f3f3f3f3f3f3f
inline int read()
{
	char ch=getchar(); int nega=1; while(!isdigit(ch)) {if(ch=='-') nega=-1; ch=getchar();}
	int ans=0; while(isdigit(ch)) {ans=ans*10+ch-48;ch=getchar();}
	if(nega==-1) return -ans;
	return ans;
}
typedef pair<int,int> pii;
void print(vector<int> x){for(int i=0;i<(int)x.size();i++) printf("%d%c",x[i]," \n"[i==(int)x.size()-1]);}
#define N 200005
int a[N],n,d,b[N],f[N];
int get()
{
	for(int i=1;i<=n;i++) f[i]=1;
	for(int i=1;i<=n;i++)
	{
		for(int j=1;j<i;j++) if(b[i]>b[j]) f[i]=max(f[i],f[j]+1);
	}
	int ans=0;
	for(int i=1;i<=n;i++) ans=max(ans,f[i]);
//	for(int i=1;i<=n;i++) printf("%d%c",b[i]," \n"[i==n]);
//	cout<<ans<<endl;
	return ans;
}
signed main()
{
	cin>>n>>d;
	for(int i=1;i<=n;i++) a[i]=read();
	int ans=0;
	for(int i=1;i<=n;i++)
	{
		for(int j=1;j<i;j++) b[j]=a[j];
		for(int j=i;j<=n;j++) b[j]=a[j]+d;
		ans=max(ans,get());
	}
	cout<<ans<<endl;
	return 0;
}

Subtask #1

5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	0 ms	296 KB	Output is correct
4	Correct	1 ms	300 KB	Output is correct
5	Correct	1 ms	296 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct
8	Correct	1 ms	288 KB	Output is correct
9	Correct	1 ms	300 KB	Output is correct
10	Correct	1 ms	300 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct

Subtask #2

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	0 ms	296 KB	Output is correct
4	Correct	1 ms	300 KB	Output is correct
5	Correct	1 ms	296 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct
8	Correct	1 ms	288 KB	Output is correct
9	Correct	1 ms	300 KB	Output is correct
10	Correct	1 ms	300 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	1 ms	296 KB	Output is correct
13	Correct	1 ms	320 KB	Output is correct
14	Correct	1 ms	204 KB	Output is correct
15	Correct	1 ms	204 KB	Output is correct
16	Correct	1 ms	204 KB	Output is correct
17	Correct	1 ms	204 KB	Output is correct
18	Correct	1 ms	204 KB	Output is correct

Subtask #3

13.0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	0 ms	296 KB	Output is correct
4	Correct	1 ms	300 KB	Output is correct
5	Correct	1 ms	296 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct
8	Correct	1 ms	288 KB	Output is correct
9	Correct	1 ms	300 KB	Output is correct
10	Correct	1 ms	300 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	1 ms	296 KB	Output is correct
13	Correct	1 ms	320 KB	Output is correct
14	Correct	1 ms	204 KB	Output is correct
15	Correct	1 ms	204 KB	Output is correct
16	Correct	1 ms	204 KB	Output is correct
17	Correct	1 ms	204 KB	Output is correct
18	Correct	1 ms	204 KB	Output is correct
19	Correct	1584 ms	308 KB	Output is correct
20	Correct	1567 ms	316 KB	Output is correct
21	Correct	1598 ms	312 KB	Output is correct
22	Correct	1576 ms	308 KB	Output is correct
23	Correct	1435 ms	308 KB	Output is correct
24	Correct	1426 ms	304 KB	Output is correct
25	Correct	1296 ms	304 KB	Output is correct
26	Correct	1815 ms	300 KB	Output is correct

Subtask #4

0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Execution timed out	2076 ms	4556 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #5

0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Execution timed out	2086 ms	1356 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #6

0 / 17.0

#	Verdict	Execution time	Memory	Grader output
1	Execution timed out	2091 ms	2344 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #7

0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	0 ms	296 KB	Output is correct
4	Correct	1 ms	300 KB	Output is correct
5	Correct	1 ms	296 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct
8	Correct	1 ms	288 KB	Output is correct
9	Correct	1 ms	300 KB	Output is correct
10	Correct	1 ms	300 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	1 ms	296 KB	Output is correct
13	Correct	1 ms	320 KB	Output is correct
14	Correct	1 ms	204 KB	Output is correct
15	Correct	1 ms	204 KB	Output is correct
16	Correct	1 ms	204 KB	Output is correct
17	Correct	1 ms	204 KB	Output is correct
18	Correct	1 ms	204 KB	Output is correct
19	Correct	1584 ms	308 KB	Output is correct
20	Correct	1567 ms	316 KB	Output is correct
21	Correct	1598 ms	312 KB	Output is correct
22	Correct	1576 ms	308 KB	Output is correct
23	Correct	1435 ms	308 KB	Output is correct
24	Correct	1426 ms	304 KB	Output is correct
25	Correct	1296 ms	304 KB	Output is correct
26	Correct	1815 ms	300 KB	Output is correct
27	Execution timed out	2076 ms	4556 KB	Time limit exceeded
28	Halted	0 ms	0 KB	-