oj.uz

Submission #60078

# Submission time Handle Problem Language Result Execution time Memory
60078 2018-07-23T15:50:10 Z dukati8 Horses (IOI15_horses) C++14
0 / 100
 1500 ms 12312 KB 
#include "horses.h"
#include <bits/stdc++.h>
#define rep(i,a,b) for(int i=a; i<int(b); i++)
using namespace std;
int n;
long long x[500000],y[500000];
long long m=1000000000+7;

pair<long long,long long> invgcd(long long a, long long b) {
	//Returns x and y such that ax+by=1
	if (a==1 && b==0) return make_pair(1,0);
	long long c=a%b;
	long long d=a/b;
	pair<long long, long long > ans = invgcd(b,c);
	return make_pair(ans.second,ans.first-ans.second*d);
}
long long inverse(long long a) {
	pair<long long, long long > ans = invgcd(m,a);
	return ans.second;
}
int init(int N, int X[], int Y[]) {
	n=N;
	rep (i,0,n) {
		x[i]=X[i];
		y[i]=Y[i];
	}
	long long product=1;
	rep (i,0,n) {
		product*=x[i];
		product%=m;
	}
	long long hi=y[n-1];
	long long divide=1;
	for (int i = n-2; i>=0; i--) {
		hi*=x[i+1];
		hi=max(hi,y[i]);
		divide*=x[i+1];
		if (hi>1000000000) break;
	}
	long long ans=hi*product;
	ans%=m;
	ans*=inverse(divide);
	ans%=m;
	return ans;


}

int updateX(int pos, int val) {
	x[pos]=val;
	long long product=1;
	rep (i,0,n) {
		product*=x[i];
		product%=m;
	}
	long long hi=y[n-1];
	long long divide=1;
	for (int i = n-2; i>=0; i--) {
		hi*=x[i+1];
		hi=max(hi,y[i]);
		divide*=x[i+1];
		if (hi>1000000000) break;
	}
	long long ans=hi*product;
	ans%=m;
	ans*=inverse(divide);
	ans%=m;
	return ans;
}

int updateY(int pos, int val) {
	y[pos]=val;
	long long product=1;
	rep (i,0,n) {
		product*=x[i];
		product%=m;
	}
	long long hi=y[n-1];
	long long divide=1;
	for (int i = n-2; i>=0; i--) {
		hi*=x[i+1];
		hi=max(hi,y[i]);
		divide*=x[i+1];
		if (hi>1000000000) break;
	}
	long long ans=hi*product;
	ans%=m;
	ans*=inverse(divide);
	ans%=m;
	return ans;
}

Compilation message

horses.cpp: In function 'int init(int, int*, int*)':
horses.cpp:44:9: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
  return ans;
         ^~~
horses.cpp: In function 'int updateX(int, int)':
horses.cpp:68:9: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
  return ans;
         ^~~
horses.cpp: In function 'int updateY(int, int)':
horses.cpp:90:9: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
  return ans;
         ^~~

Subtask #1
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Incorrect 3 ms 488 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 552 KB Output is correct
2 Incorrect 5 ms 552 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1521 ms 12312 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12312 KB Output is correct
2 Incorrect 2 ms 12312 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12312 KB Output is correct
2 Incorrect 3 ms 12312 KB Output isn't correct
3 Halted 0 ms 0 KB -