Submission #311039

#	Time	Username	Problem	Language	Result	Execution time	Memory
311039		anakib1	Horses (IOI15_horses)	C++17	37 / 100	711 ms	22008 KiB

horses

//나는 가상 소녀들에게 큰 호감이 있습니다.

#include <iostream>
#include <cmath>
#include <algorithm>
#include <stdio.h>
#include <cstring>
#include <string>
#include <cstdlib>
#include <vector>
#include <bitset>
#include <map>
#include <chrono>
#include <functional>
#include <unordered_set>
#include <unordered_map>
#include <numeric>
#include <queue>
#include <ctime>
#include <stack>
#include <set>
#include <list>
#include <deque>
#include <iomanip>
#include <sstream>
#include <fstream>
#include <stdarg.h>
#include <utility>

using namespace std;

#define pb push_back
#define mp make_pair
#define ll long long
#define ull unisgned long long
#define ld long double
#define all(a) a.begin(), a.end()
#define SORT(a) sort(all(a))
#define pii pair<int, int>
#define tii triple<int, int, int>
#define e 1e-7
#define PI acos(-1)
#define sz(a) (int)(a.size())
#define inf 1e17
#define vi vector<int>
#define F first
#define S second
#define rng(x) for(int _ = 0; _ < (x); _++)
#define rngi(i, x) for(int i = 0; i < (x); i++)
#define rngsi(s, i, x) for(int i = (s); i <(x); i++)
#define problem "a"

template<typename A, typename B, typename C>
struct triple {
	A X;
	B Y;
	C Z;
	triple(A a = 0, B b = 0, C c = 0) :X(a), Y(b), Z(c) {}
};
template<typename A, typename B, typename C>
triple<A, B, C> make_triple(A a = 0, B b = 0, C c = 0) {
	return triple<A, B, C>(a, b, c);
}
template<typename A, typename B, typename C>
bool operator<(const triple<A, B, C>& a, const triple<A, B, C>& b) {
	if (a.X != b.X)
		return a.X < b.X;
	if (a.Y != b.Y)
		return a.Y < b.Y;
	return a.Z < b.Z;
}
template<typename T, typename SS>
ostream& operator<<(ostream& ofs, const pair<T, SS>& p) {
	ofs << "( " << p.F << " , " << p.S << " )";
	return ofs;
}
template<typename T>
void print(T a) {
	for (auto i : a)
		cout << i << ' ';
	cout << '\n';
}
template<typename T>
T max(T a, T b, T c) {
	return max(a, max(b, c));
}
template<typename T>
T min(T a, T b, T c) {
	return min(a, min(b, c));
}
template<typename T, typename D>
D min(T a) {
	return *min_element(all(a));
}
template<typename T, typename D>
D max(T a) {
	return *max_element(all(a));
}
struct custom_hash {
	static uint64_t splitmix64(uint64_t x) {
		x += 0x9e3779b97f4a7c15;
		x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
		x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
		return x ^ (x >> 31);
	}

	size_t operator()(uint64_t x) const {
		static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
		return splitmix64(x + FIXED_RANDOM);
	}
};



static char _buffer[1024];
static int _currentChar = 0;
static int _charsNumber = 0;
static FILE* _inputFile, * _outputFile;

static inline int _read() {
	if (_charsNumber < 0) {
		exit(1);
	}
	if (!_charsNumber || _currentChar == _charsNumber) {
		_charsNumber = (int)fread(_buffer, sizeof(_buffer[0]), sizeof(_buffer), _inputFile);
		_currentChar = 0;
	}
	if (_charsNumber <= 0) {
		return -1;
	}
	return _buffer[_currentChar++];
}

static inline int _readInt() {
	int c, x, s;
	c = _read();
	while (c <= 32) c = _read();
	x = 0;
	s = 1;
	if (c == '-') {
		s = -1;
		c = _read();
	}
	while (c > 32) {
		x *= 10;
		x += c - '0';
		c = _read();
	}
	if (s < 0) x = -x;
	return x;
}
int n, st;
vi x, y;
const ll mod = 1e9 + 7;
int pw(int x, int y) {
	if (!y) return 1;
	int v = pw(x, y >> 1);
	v = (v * 1LL * v) % mod;
	if (y & 1) v = (v * 1LL * x) % mod;
	return v;
}
int pr = 1;
int solve() {
	ld ans = 0;
	int p = st;
	vector<ld> v(n - st);
	v[0] = 0;
	for (int i = st + 1; i < n; i++) v[i - st] = v[i - st - 1] + log2l(x[i]);
	for (int i = st; i < n; i++) if (ans < v[i - st] + log2l(y[i])) { p = i; ans = v[i - st] + log2l(y[i]); }
	ll res = pr;
	//cout << p << '\n';
	for(int i = st; i <= p; i++) res = (res * 1LL  * x[i]) % mod;
	return (res * 1LL * y[p]) %mod;
}
int solve2() {

}
int init(int N, int X[], int Y[]) {
	n = N; x = y = vi(n);
	st = max(0, n - 34);
	rngi(i, n) x[i] = X[i], y[i] = Y[i];
	for (int i = 0; i < st; i++) pr = (pr * 1LL * x[i]) % mod;
	return solve();
}

int updateX(int pos, int val) {
	if (pos < st) {
		pr = (pr * 1LL * pw(x[pos], mod - 2)) % mod;
		pr = (pr * 1LL * val) % mod;
	}

	x[pos] = val;
	return solve();
}

int updateY(int pos, int val) {
	y[pos] = val;
	return solve();
}


/*int main() {
	_inputFile = fopen("horses.in", "rb");
	_outputFile = fopen("horses.out", "w");

	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();
	}

	fprintf(_outputFile, "%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) {
			fprintf(_outputFile, "%d\n", updateX(pos, val));
		}
		else if (type == 2) {
			fprintf(_outputFile, "%d\n", updateY(pos, val));
		}
	}

	return 0;
}
*/

Compilation message (stderr)

horses.cpp: In function 'int pw(int, int)':
horses.cpp:155:20: warning: declaration of 'y' shadows a global declaration [-Wshadow]
  155 | int pw(int x, int y) {
      |                    ^
horses.cpp:153:7: note: shadowed declaration is here
  153 | vi x, y;
      |       ^
horses.cpp:155:20: warning: declaration of 'x' shadows a global declaration [-Wshadow]
  155 | int pw(int x, int y) {
      |                    ^
horses.cpp:153:4: note: shadowed declaration is here
  153 | vi x, y;
      |    ^
horses.cpp:158:20: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
  158 |  v = (v * 1LL * v) % mod;
      |      ~~~~~~~~~~~~~~^~~~~
horses.cpp:159:31: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
  159 |  if (y & 1) v = (v * 1LL * x) % mod;
      |                 ~~~~~~~~~~~~~~^~~~~
horses.cpp: In function 'int solve()':
horses.cpp:173:28: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
  173 |  return (res * 1LL * y[p]) %mod;
      |         ~~~~~~~~~~~~~~~~~~~^~~~
horses.cpp: In function 'int solve2()':
horses.cpp:177:1: warning: no return statement in function returning non-void [-Wreturn-type]
  177 | }
      | ^
horses.cpp: In function 'int init(int, int*, int*)':
horses.cpp:182:54: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
  182 |  for (int i = 0; i < st; i++) pr = (pr * 1LL * x[i]) % mod;
      |                                    ~~~~~~~~~~~~~~~~~~^~~~~
horses.cpp: In function 'int updateX(int, int)':
horses.cpp:188:41: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
  188 |   pr = (pr * 1LL * pw(x[pos], mod - 2)) % mod;
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
horses.cpp:189:25: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
  189 |   pr = (pr * 1LL * val) % mod;
      |        ~~~~~~~~~~~~~~~~~^~~~~
horses.cpp: At global scope:
horses.cpp:118:28: warning: '_outputFile' defined but not used [-Wunused-variable]
  118 | static FILE* _inputFile, * _outputFile;
      |                            ^~~~~~~~~~~

• Subtask 1: 17 / 17
• Subtask 2: 0 / 17
• Subtask 3: 20 / 20
• Subtask 4: 0 / 23
• Subtask 5: 0 / 23