oj.uz

답안 #992696

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
992696 2024-06-05T03:31:02 Z cpptowin 3단 점프 (JOI19_jumps) C++17
5 / 100
 4000 ms 2648 KB 
#include <bits/stdc++.h>
#define fo(i, d, c) for (int i = d; i <= c; i++)
#define fod(i, c, d) for (int i = c; i >= d; i--)
#define maxn 1000010
#define N 1010
#define fi first
#define se second
#define pb emplace_back
#define en cout << "\n";
#define int long long
#define inf (int)1e18
#define pii pair<int, int>
#define vii vector<pii>
#define lb(x) x & -x
#define bit(i, j) ((i >> j) & 1)
#define offbit(i, j) (i ^ (1LL << j))
#define onbit(i, j) (i | (1LL << j))
#define vi vector<int>
template <typename T1, typename T2>
bool minimize(T1 &a, T2 b)
{
	if (a > b)
	{
		a = b;
		return true;
	}
	return false;
}
template <typename T1, typename T2>
bool maximize(T1 &a, T2 b)
{
	if (a < b)
	{
		a = b;
		return true;
	}
	return false;
}
using namespace std;
const int nsqrt = 450;
const int mod = 1e9 + 7;
int n;
int a[maxn];
main()
{
#define name "TASK"
	if (fopen(name ".inp", "r"))
	{
		freopen(name ".inp", "r", stdin);
		freopen(name ".out", "w", stdout);
	}
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
    cin >> n;
	fo(i,1,n) cin >> a[i];
	int q;cin >> q;
	while(q--)
	{
		int ans = 0;
		int l,r;
		cin >> l >> r;
		fo(i,l,r) fo(j,i + 1,r) fo(k,j + 1,r)
		{
			if(k - j >= j - i) maximize(ans,a[i] + a[j] + a[k]);
		}
		cout << ans;en;
	}
}

Compilation message

jumps.cpp:44:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   44 | main()
      | ^~~~
jumps.cpp: In function 'int main()':
jumps.cpp:49:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   49 |   freopen(name ".inp", "r", stdin);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
jumps.cpp:50:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   50 |   freopen(name ".out", "w", stdout);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 2 ms 348 KB Output is correct
3 Correct 2 ms 344 KB Output is correct
4 Correct 2 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 2 ms 464 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 3 ms 464 KB Output is correct
9 Correct 3 ms 348 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Execution timed out 4065 ms 604 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 4002 ms 2648 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 54.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 2 ms 348 KB Output is correct
3 Correct 2 ms 344 KB Output is correct
4 Correct 2 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 2 ms 464 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 3 ms 464 KB Output is correct
9 Correct 3 ms 348 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Execution timed out 4065 ms 604 KB Time limit exceeded
12 Halted 0 ms 0 KB -