Submission #1247197

#TimeUsernameProblemLanguageResultExecution timeMemory
1247197SpyrosAlivHorses (IOI15_horses)C++20
0 / 100
22 ms8536 KiB
#include "horses.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long

int n;
vector<int> x, y;

int init(int N, int X[], int Y[]) {
	n = N;
	for (int i = 0; i < n; i++) {
		x.push_back(X[i]);
		y.push_back(Y[i]);
	}
	int ans = 0;
	int tot = 1;
	for (int i = 0; i < n; i++) {
		ans = max(ans, tot * y[i]);
		tot *= 2;
	}
	return ans;
}

int updateX(int pos, int val) {	
	return 0;
}

int updateY(int pos, int val) {
	return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...