oj.uz

Submission #62294

# Submission time Handle Problem Language Result Execution time Memory
62294 2018-07-28T03:43:33 Z Tenuun Horses (IOI15_horses) C++17
17 / 100
 1500 ms 38068 KB 
#include<bits/stdc++.h>
#define mod 1000000007
#define ll long long

using namespace std;

int n, tr[2000000], id[500001];
ll now=1;
vector<int>x, y;
set<int>a;
void pre(){
	int last=-1;
	a.insert(-1);
	a.insert(0);
	for(int i=1; i<n; i++){
		if(x[i]>1){
			a.insert(i);
		}
	}
}

void build(int ind, int l, int r){
	if(l==r){
		tr[ind]=y[l];
		id[l]=ind;
		return;
	}
	build(ind*2, l, (l+r)/2);
	build(ind*2+1, (l+r)/2+1, r);
	tr[ind]=max(tr[ind*2], tr[ind*2+1]);
}

void upd(int ind){
	if(ind==0) return;
	tr[ind]=max(tr[ind*2], tr[ind*2+1]);
	upd(ind/2);
}

ll rmq(int ind, int l, int r, int L, int R){
	if(l==L && r==R) return tr[ind];
	int m=(l+r)/2;
	if(R<=m) return rmq(ind*2, l, m, L, R);
	else if(L>m) return rmq(ind*2+1, m+1, r, L, R);
	else{
		return max(rmq(ind*2, l, m, L, m), rmq(ind*2+1, m+1, r, m+1, R));
	}
}

ll find(){
	ll ans=1;
	ll now=rmq(1, 0, n-1, *prev(a.end()), n-1);
	set<int>::iterator it;
	for(it=prev(a.end()); it!=a.begin() && now<mod; it--){
		if(now*x[*it]>mod) break;
		now*=x[*it];
	}
	ans=now;
	now/=rmq(1, 0, n-1, *prev(a.end()), n-1);
	for(set<int>::iterator tmp=prev((prev(a.end()))); tmp!=prev(it) && tmp!=a.begin(); tmp--){
		now/=x[*next(tmp)];
		ans=max(ans, now*rmq(1, 0, n-1, *tmp, *next(tmp)-1));
	}
	for(; it!=a.begin(); it--){
		ans*=x[*it];
		ans%=mod;
	}
	return ans;
}

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]);}
	pre();
	build(1, 0, n-1);
	return find();
}

int updateX(int pos, int val){
	if(x[pos]==1 && val==1) return find();
	if(x[pos]>1 && val>1){
		x[pos]=val;
		///now/x[pos]*val;
		return find();
	}
	if(x[pos]==1){
		a.insert(pos);
		x[pos]=val;
	}
	else{
		a.erase(a.find(pos));
		x[pos]=1;
	}
	return find();
}

int updateY(int pos, int val){
	tr[id[pos]]=val;
	upd(id[pos]/2);
	return find();
}

Compilation message

horses.cpp: In function 'void pre()':
horses.cpp:12:6: warning: unused variable 'last' [-Wunused-variable]
  int last=-1;
      ^~~~
horses.cpp: In function 'long long int find()':
horses.cpp:51:5: warning: declaration of 'now' shadows a global declaration [-Wshadow]
  ll now=rmq(1, 0, n-1, *prev(a.end()), n-1);
     ^~~
horses.cpp:8:4: note: shadowed declaration is here
 ll now=1;
    ^~~
horses.cpp: In function 'int init(int, int*, int*)':
horses.cpp:75:13: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
  return find();
         ~~~~^~
horses.cpp: In function 'int updateX(int, int)':
horses.cpp:79:37: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
  if(x[pos]==1 && val==1) return find();
                                 ~~~~^~
horses.cpp:83:14: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
   return find();
          ~~~~^~
horses.cpp:93:13: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
  return find();
         ~~~~^~
horses.cpp: In function 'int updateY(int, int)':
horses.cpp:99:13: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
  return find();
         ~~~~^~

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 252 KB Output is correct
2 Correct 2 ms 356 KB Output is correct
3 Correct 3 ms 560 KB Output is correct
4 Correct 3 ms 612 KB Output is correct
5 Correct 2 ms 612 KB Output is correct
6 Correct 2 ms 612 KB Output is correct
7 Correct 2 ms 612 KB Output is correct
8 Correct 3 ms 612 KB Output is correct
9 Correct 2 ms 612 KB Output is correct
10 Correct 3 ms 620 KB Output is correct
11 Correct 3 ms 620 KB Output is correct
12 Correct 2 ms 740 KB Output is correct
13 Correct 2 ms 740 KB Output is correct
14 Correct 2 ms 740 KB Output is correct
15 Correct 2 ms 740 KB Output is correct
16 Correct 2 ms 740 KB Output is correct
17 Correct 2 ms 740 KB Output is correct
18 Correct 2 ms 740 KB Output is correct
19 Correct 2 ms 740 KB Output is correct
20 Correct 3 ms 740 KB Output is correct

Subtask #2
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 740 KB Output is correct
2 Correct 3 ms 740 KB Output is correct
3 Correct 4 ms 740 KB Output is correct
4 Correct 3 ms 740 KB Output is correct
5 Correct 4 ms 740 KB Output is correct
6 Correct 3 ms 740 KB Output is correct
7 Correct 3 ms 740 KB Output is correct
8 Correct 2 ms 740 KB Output is correct
9 Correct 2 ms 740 KB Output is correct
10 Correct 3 ms 740 KB Output is correct
11 Correct 2 ms 740 KB Output is correct
12 Correct 3 ms 740 KB Output is correct
13 Correct 3 ms 740 KB Output is correct
14 Correct 3 ms 740 KB Output is correct
15 Correct 4 ms 740 KB Output is correct
16 Correct 2 ms 740 KB Output is correct
17 Correct 3 ms 740 KB Output is correct
18 Correct 3 ms 740 KB Output is correct
19 Correct 4 ms 740 KB Output is correct
20 Correct 4 ms 740 KB Output is correct
21 Correct 4 ms 740 KB Output is correct
22 Incorrect 3 ms 748 KB Output isn't correct
23 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

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

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 38068 KB Output is correct
2 Correct 2 ms 38068 KB Output is correct
3 Correct 3 ms 38068 KB Output is correct
4 Correct 3 ms 38068 KB Output is correct
5 Correct 2 ms 38068 KB Output is correct
6 Correct 4 ms 38068 KB Output is correct
7 Correct 3 ms 38068 KB Output is correct
8 Correct 3 ms 38068 KB Output is correct
9 Correct 2 ms 38068 KB Output is correct
10 Correct 2 ms 38068 KB Output is correct
11 Correct 3 ms 38068 KB Output is correct
12 Correct 3 ms 38068 KB Output is correct
13 Correct 2 ms 38068 KB Output is correct
14 Correct 3 ms 38068 KB Output is correct
15 Correct 3 ms 38068 KB Output is correct
16 Correct 3 ms 38068 KB Output is correct
17 Correct 3 ms 38068 KB Output is correct
18 Correct 3 ms 38068 KB Output is correct
19 Correct 2 ms 38068 KB Output is correct
20 Correct 3 ms 38068 KB Output is correct
21 Correct 2 ms 38068 KB Output is correct
22 Incorrect 3 ms 38068 KB Output isn't correct
23 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 38068 KB Output is correct
2 Correct 2 ms 38068 KB Output is correct
3 Correct 3 ms 38068 KB Output is correct
4 Correct 3 ms 38068 KB Output is correct
5 Correct 2 ms 38068 KB Output is correct
6 Correct 2 ms 38068 KB Output is correct
7 Correct 4 ms 38068 KB Output is correct
8 Correct 3 ms 38068 KB Output is correct
9 Correct 3 ms 38068 KB Output is correct
10 Correct 4 ms 38068 KB Output is correct
11 Correct 3 ms 38068 KB Output is correct
12 Correct 2 ms 38068 KB Output is correct
13 Correct 2 ms 38068 KB Output is correct
14 Correct 3 ms 38068 KB Output is correct
15 Correct 2 ms 38068 KB Output is correct
16 Correct 3 ms 38068 KB Output is correct
17 Correct 3 ms 38068 KB Output is correct
18 Correct 3 ms 38068 KB Output is correct
19 Correct 3 ms 38068 KB Output is correct
20 Correct 2 ms 38068 KB Output is correct
21 Correct 2 ms 38068 KB Output is correct
22 Incorrect 3 ms 38068 KB Output isn't correct
23 Halted 0 ms 0 KB -