oj.uz

답안 #1025201

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1025201 2024-07-16T17:30:06 Z YassirSalama 말 (IOI15_horses) C++17
54 / 100
 1500 ms 25740 KB 
#include<bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define all(v) v.begin(),v.end()
#define ll long long
template<typename T> 
void dbg_out(const T& t){
	cout<<t<<endl;
}
template<typename T,typename... Args>
void dbg_out(const T& t,const Args&... args){
	cout<<t<<" , ";
	dbg_out(args...);
}
#define dbg(...) cout<<"("<<#__VA_ARGS__<<"): ";dbg_out(__VA_ARGS__);
const ll mod=1e9+7;
const int maxn=2000;
int n;
vector<ll> x;
vector<ll> y;
ll binpow(int a,int b){
	ll ans=1;
	while(b){
		if(b&1) ans=(ans%mod*a%mod)%mod;
		b>>=1;
		a=(a%mod*a%mod)%mod;
	}
	return ans;
}
ll invmod(int a){
	return binpow(a,mod-2);
}
ll ymx=1e9;
ll pref=1;
ll solve(){
	__int128_t suff=1;
	ll p=pref;
    for(int i=n-1;i>=0;i--){
    	suff=max(suff,(__int128_t)1LL*y[i]);
    	if(suff>=ymx){
    		return (p*suff%mod)%mod;
    	}
    	suff*=x[i];
    	p=p*invmod(x[i])%mod;
    }
    return (suff%mod*p%mod)%mod;
}
int init(int N, int X[], int Y[]) {
	n=N;
	x.resize(n,0);
	y.resize(n,0);
	for(int i=0;i<n;i++){
		x[i]=X[i];
		pref=pref*x[i]%mod;
	}
	for(int i=0;i<n;i++){
		y[i]=Y[i];
	}
	return (int)((ll)solve()%mod);
}
 
int updateX(int pos, int val) {	
	pref=(pref%mod*invmod(x[pos])%mod)%mod;
	x[pos]=val;
	x[pos]%=mod;
	pref=(pref%mod*x[pos]%mod)%mod;
	return solve()%mod;
}
 
int updateY(int pos, int val) {
	y[pos]=val;
	y[pos]%=mod;
	return solve()%mod;
}
 
 
#ifdef IOI
 
 
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 main() {
	// _inputFile = fopen("horses.in", "rb");
	// _outputFile = fopen("horses.out", "w");
	
	int N; 
	cin>>N;
 
	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++) {
		cin>>X[i];
	}
 
	for (int i = 0; i < N; i++) {
		cin>>Y[i];
	}	
	cout<<init(N,X,Y)<<endl;
 
 
	int M; 
	// M = _readInt();
	cin>>M;
 
	for (int i = 0; i < M; i++) {
		int type; 
		int pos; 
		int val; 
		cin>>type>>pos>>val;
		if (type == 1) {
			cout<<updateX(pos,val)<<endl;
			// fprintf(_outputFile,"%d\n",updateX(pos,val));
		} else if (type == 2) {
			cout<<updateY(pos,val)<<endl;
			// fprintf(_outputFile,"%d\n",updateY(pos,val));
		}
	}
 
	return 0;
}
 
#endif

Compilation message

horses.cpp: In function 'long long int binpow(int, int)':
horses.cpp:27:18: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   27 |   a=(a%mod*a%mod)%mod;
      |     ~~~~~~~~~~~~~^~~~
horses.cpp: In function 'long long int solve()':
horses.cpp:42:26: warning: conversion from '__int128' to 'long long int' may change value [-Wconversion]
   42 |       return (p*suff%mod)%mod;
      |              ~~~~~~~~~~~~^~~~
horses.cpp:45:21: warning: conversion from '__gnu_cxx::__alloc_traits<std::allocator<long long int>, long long int>::value_type' {aka 'long long int'} to 'int' may change value [-Wconversion]
   45 |      p=p*invmod(x[i])%mod;
      |                     ^
horses.cpp:47:28: warning: conversion from '__int128' to 'long long int' may change value [-Wconversion]
   47 |     return (suff%mod*p%mod)%mod;
      |            ~~~~~~~~~~~~~~~~^~~~
horses.cpp: In function 'int updateX(int, int)':
horses.cpp:64:30: warning: conversion from '__gnu_cxx::__alloc_traits<std::allocator<long long int>, long long int>::value_type' {aka 'long long int'} to 'int' may change value [-Wconversion]
   64 |  pref=(pref%mod*invmod(x[pos])%mod)%mod;
      |                              ^
horses.cpp:68:16: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   68 |  return solve()%mod;
      |         ~~~~~~~^~~~
horses.cpp: In function 'int updateY(int, int)':
horses.cpp:74:16: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   74 |  return solve()%mod;
      |         ~~~~~~~^~~~

Subtask #1
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 420 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct

Subtask #2
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 7 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 3 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 66 ms 348 KB Output is correct
28 Correct 4 ms 344 KB Output is correct
29 Correct 254 ms 436 KB Output is correct
30 Correct 65 ms 456 KB Output is correct
31 Correct 246 ms 348 KB Output is correct
32 Correct 75 ms 348 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 725 ms 13100 KB Output is correct
2 Correct 72 ms 13136 KB Output is correct
3 Correct 170 ms 13136 KB Output is correct
4 Correct 100 ms 20564 KB Output is correct

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 6 ms 460 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 3 ms 348 KB Output is correct
26 Correct 1 ms 376 KB Output is correct
27 Correct 66 ms 348 KB Output is correct
28 Correct 4 ms 348 KB Output is correct
29 Correct 241 ms 344 KB Output is correct
30 Correct 66 ms 344 KB Output is correct
31 Correct 245 ms 692 KB Output is correct
32 Correct 75 ms 440 KB Output is correct
33 Execution timed out 1530 ms 12168 KB Time limit exceeded
34 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 7 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 3 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 67 ms 432 KB Output is correct
28 Correct 4 ms 344 KB Output is correct
29 Correct 255 ms 348 KB Output is correct
30 Correct 65 ms 348 KB Output is correct
31 Correct 244 ms 348 KB Output is correct
32 Correct 76 ms 600 KB Output is correct
33 Correct 690 ms 13212 KB Output is correct
34 Correct 81 ms 25740 KB Output is correct
35 Correct 172 ms 16724 KB Output is correct
36 Correct 105 ms 20560 KB Output is correct
37 Execution timed out 1541 ms 15952 KB Time limit exceeded
38 Halted 0 ms 0 KB -