제출 #446373

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
446373		mansur	Exam (eJOI20_exam)	C++17	0 / 100	1081 ms	1100 KiB

exam

#include<bits/stdc++.h>

#pragma optimize ("g",on)
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC optimize ("03")
#pragma GCC target ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,avx2,mmx,fma,avx,tune=native")


using namespace std;

#define all(a) a.begin(), a.end()
#define ll long long
#define pb push_back
#define nl '\n'
#define popb pop_back()
#define sz size()
#define ld long double
#define ull unsigned long long
#define F first
#define S second
#define fix fixed << setprecision
#define pii pair<int, int>
#define E exit (0)
#define int long long

const ll inf = (1ll << 62ll), N = 5e5 + 5, mod = 1e9 + 7;

signed main() {
	//freopen("invtrans.in", "r", stdin);
	//freopen("invtrans.out", "w", stdout);
	ios_base::sync_with_stdio(NULL);
	cin.tie(NULL);
	int n;
	cin >> n;
	int a[n + 1], b[n + 1];
	int dp[n + 1];
	dp[0] = 0;
	for (int i = 1; i <= n; i++) cin >> a[i];
	for (int i = 1; i <= n; i++) cin >> b[i];
	for (int i = 1; i <= n; i++) {
		dp[i] = 0;
		map<int, int> cnt;
		int mx = 0;
		for (int j = i; j >= 1; j--) {
			mx = max(mx, a[j]);
			cnt[b[j]]++;
			dp[i] = max(dp[i], dp[j - 1] + cnt[mx]);	
		}
	}
	cout << dp[n];
}	

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

exam.cpp:3: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    3 | #pragma optimize ("g",on)
      |

• Subtask 1: 0 / 14
• Subtask 2: 0 / 12
• Subtask 3: 0 / 13
• Subtask 4: 0 / 23
• Subtask 5: 0 / 16
• Subtask 6: 0 / 22