제출 #912254

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
912254		vjudge1	Rabbit Carrot (LMIO19_triusis)	C++17	0 / 100	2 ms	344 KiB

triusis

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
#define ent "\n"

const int inf = (int)1e9 + 100;
const int maxn = 5e5 + 100;
const ll INF = (ll)1e18;
const int MOD = 1e9 + 7;
const int maxl = 62500;
const ll P = 31, T = 0;

int n, m;
ll a[maxn];
int t[maxn];

int get(int i){ 
	int res = 0;
	for(; i > 0; i = (i & (i + 1)) - 1) res = max(res, t[i]);
	return res;
}

void upd(int i, int x){
	for(; i <= n; i |= (i + 1)) t[i] = max(t[i], x); 
}

void test(){
	cin >> n >> m;
	vector<int> ord(1, 0);
	for(int i = 1; i <= n; i++){
		cin >> a[i];
		a[i] -= 1ll * i * m;
		ord.push_back(i);
	}
	sort(ord.begin(), ord.end(), [](int i, int j){
		if(a[i] != a[j]) return a[i] < a[j];
		return i > j;
	});
	int ans;
	for(int i: ord){
		int d = get(n - i + 1) + 1;
		upd(n - i + 1, d);
		if(!i) ans = n - d + 1;
	}
	cout << ans;
}

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    #ifndef ONLINE_JUDGE
	    freopen("input.txt", "r", stdin);
	    freopen("output.txt", "w", stdout);
    #endif
    int t = 1;
    if(T) cin >> t;
    while(t--) test();
}

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

triusis.cpp: In function 'int main()':
triusis.cpp:54:13: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   54 |      freopen("input.txt", "r", stdin);
      |      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
triusis.cpp:55:13: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   55 |      freopen("output.txt", "w", stdout);
      |      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
triusis.cpp: In function 'void test()':
triusis.cpp:47:10: warning: 'ans' may be used uninitialized in this function [-Wmaybe-uninitialized]
   47 |  cout << ans;
      |          ^~~

• Subtask 1: 0 / 14
• Subtask 2: 0 / 21
• Subtask 3: 0 / 28
• Subtask 4: 0 / 37