oj.uz

답안 #832569

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
832569 2023-08-21T11:51:34 Z AkramElOmrani 말 (IOI15_horses) C++17
0 / 100
 13 ms 8356 KB 
#include <stdio.h>
#include <stdlib.h>
#include <bits/stdc++.h>
using namespace std;

#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,avx2,bmi,bmi2,popcnt,lzcnt")

#define ll long long

template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type> ostream& operator<<(ostream &os, const T_container &v) { os << '{'; string sep; for (const T &x : v) os << sep << x, sep = ", "; return os << '}'; }
 
void dbg_out() { cerr << endl; }
template<typename Head, typename... Tail> void dbg_out(Head H, Tail... T) { cerr << ' ' << H; dbg_out(T...); }
#define dbg(...) cerr << "(" << #__VA_ARGS__ << "):", dbg_out(__VA_ARGS__);

const int mod = 1e9 + 7;
void max_self(int& a, int b) {
	a = max(a, b);
}

int add(int a, int b) {
	a += b;
	if(a > mod) {
		a -= mod;
	}
	return a;
}
int mul(int a, int b) {
	a = (ll)a * b % mod;
	return a;
}

const int N = 1e3 + 1;
int n;
int x[N], y[N];

int binpow(int a, int b) {
	int res = 1;
	while(b) {
		if(b & 1) {
			res = mul(a, res);
		}
		a = mul(a, a);
		b /= 2;
	}
	return res;
}

int inv(int a) {
	return binpow(a, mod - 2);
}

int p = 1;
int last;

int solve() {
	ll h = 1, p2 = 1, ans = 0;
	p2 = p;
	long double l = 0;
	for(int i = last; i < n; ++i) {
		h *= x[i];
		p2 = mul(p, x[i]);
		long double profit = (long double)y[i] * h;
		if(profit > l) {
			ans = mul(p2, y[i]); h = 1;
			l = y[i];
		}
	}
	return ans;
}

int init(int n_, int x_[], int y_[]) {
	n = n_;
	last = max(0, n - 40);
	for(int i = 0; i < last; ++i) {
		p = mul(i, x[i]);
	}

	for(int i = 0; i < n; ++i) {
		x[i] = x_[i];
		y[i] = y_[i];
	}

	return solve();
}
int updateX(int pos, int val) {
	if(pos < last) {
		p = mul(p, inv(x[pos]));
		p = mul(p, val);
	}
	x[pos] = val;
	return solve();
}
int updateY(int pos, int val) {
	y[pos] = val;
	return solve();
}





























// static char buffer[1024];
// static int currentChar = 0;
// static int charsNumber = 0;

// static inline int read() {
//   if (charsNumber < 0) {
// 	exit(1);
//   }
//   if (!charsNumber || currentChar == charsNumber) {
// 	charsNumber = (int)fread(buffer, sizeof(buffer[0]), sizeof(buffer), stdin);
// 	currentChar = 0;
//   }
//   if (charsNumber <= 0) {
// 	return -1;
//   }
//   return buffer[currentChar++];
// }

// static inline int readInt() {
//   int x; cin >> x;
//   return x;
// }

// int main() {
//   int N;
//   N = readInt();

//   int *X = (int *)malloc(sizeof(int) * (unsigned int)N);
//   int *Y = (int *)malloc(sizeof(int) * (unsigned int)N);

//   for (int i = 0; i < N; i++) {
// 	X[i] = readInt();
//   }

//   for (int i = 0; i < N; i++) {
// 	Y[i] = readInt();
//   }

//   printf("%d\n", init(N, X, Y));

//   int M;
//   M = readInt();

//   for (int i = 0; i < M; i++) {
// 	int type;
// 	type = readInt();
// 	int pos;
// 	pos = readInt();
// 	int val;
// 	val = readInt();

// 	if (type == 1) {
// 	  printf("%d\n", updateX(pos, val));
// 	} else if (type == 2) {
// 	  printf("%d\n", updateY(pos, val));
// 	}
//   }

//   return 0;
// }

Compilation message

horses.cpp: In function 'int mul(int, int)':
horses.cpp:34:16: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   34 |  a = (ll)a * b % mod;
      |      ~~~~~~~~~~^~~~~
horses.cpp: In function 'int solve()':
horses.cpp:70:14: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   70 |    ans = mul(p2, y[i]); h = 1;
      |              ^~
horses.cpp:74:9: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   74 |  return ans;
      |         ^~~

Subtask #1
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 1 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 0 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 13 ms 8356 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 0 ms 256 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 0 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -