oj.uz

답안 #925182

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
925182 2024-02-11T00:03:49 Z Karoot 말 (IOI15_horses) C++17
17 / 100
 169 ms 85320 KB 
#include "horses.h"
#include <iostream>
#include <cmath>
#include <unordered_map>
#include <map>
#include <set>
#include <queue>
#include <vector>
#include <string>
#include <iomanip>
#include <algorithm>

#define all(x)  (x).begin(), (x).end()
#define rall(x)  (x).rbegin(), (x).rend()

using namespace std;

typedef long long ll;

ll linf = 1e15+1;

inline void scoobydoobydoo(){
    ios::sync_with_stdio(false);
    ios_base::sync_with_stdio(false);
    cin.tie(NULL); cout.tie(NULL);
}

const int M = 1e9+7;
const int MAXN = 5e5+1;

long double X[MAXN], Y[MAXN];

struct Node {   
    long double sum;
    long double maxi;
    ll index;
};

Node ST[4*MAXN];
int leftOf[4*MAXN], rightOf[4*MAXN];
int indexToNode[MAXN];

void buildTree(int l, int r, int node = 1){
    leftOf[node] = l; rightOf[node] = r;
    if (l == r){
        indexToNode[l] = node;
        ST[node].index = l;
        ST[node].maxi = log2(Y[l]);
        ST[node].sum = log2(X[l]);
        ST[node].maxi += ST[node].sum;
        return;
    }
    int mid = (l+r)>>1;
    buildTree(l, mid, 2*node);
    buildTree(mid+1, r, 2*node+1);
    ST[node].sum = ST[2*node].sum + ST[2*node+1].sum;
    if (ST[2*node].maxi > ST[2*node+1].maxi+ST[2*node].sum){
        ST[node].index = ST[2*node].index;
        ST[node].maxi = ST[2*node].maxi;
    } else {
        ST[node].index = ST[2*node+1].index;
        ST[node].maxi = ST[2*node+1].maxi+ST[2*node].sum;
    }
    return;
}

int query(){
    long double rest = ST[1].maxi - floor(ST[1].maxi);
    ll bigi = ST[1].maxi;
    ll soFar = 2;

    long double ans = 1;
    for (int i = 0; i <= log2(bigi)+1; i++){
        if (bigi&(1<<i)){
            ans = ((ll)ans*soFar)%M;
        }
        soFar *= soFar;
        soFar %= M;
    }

    ans *= pow(2.0, rest);
    return ((int)round(ans))%M;
}

void update1(int node){
    if (!node)return;
    ST[node].sum = ST[2*node].sum + ST[2*node+1].sum;
    if (ST[2*node].maxi > ST[2*node+1].maxi+ST[2*node].sum){
        ST[node].index = ST[2*node].index;
        ST[node].maxi = ST[2*node].maxi;
    } else {
        ST[node].index = ST[2*node+1].index;
        ST[node].maxi = ST[2*node+1].maxi+ST[2*node].sum;
    }
    update1(node>>1);
}

int updateX(int pos, int val){
    ST[indexToNode[pos]].sum = log2((long double)val);
    ST[indexToNode[pos]].maxi = log2((long double)val) + log2(Y[pos]);
    update1(indexToNode[pos]>>1);
    return query();
}

int updateY(int pos, int val){
    ST[indexToNode[pos]].maxi = log2((long double)val) + log2(X[pos]);
    update1(indexToNode[pos]>>1);
    return query();
}

int init(int n, int x[], int y[]) {
	for(int i = 0; i < n; i++){
		X[i] = x[i];
        Y[i] = y[i];
	}
    buildTree(0, n-1);
	return query();
}

Compilation message

horses.cpp: In function 'int query()':
horses.cpp:69:21: warning: conversion from 'long double' to 'll' {aka 'long long int'} may change value [-Wfloat-conversion]
   69 |     ll bigi = ST[1].maxi;
      |               ~~~~~~^~~~

Subtask #1
17.0 / 17.0

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

Subtask #2
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 10588 KB Output is correct
2 Correct 1 ms 10588 KB Output is correct
3 Correct 1 ms 10588 KB Output is correct
4 Correct 1 ms 10588 KB Output is correct
5 Correct 2 ms 10588 KB Output is correct
6 Correct 2 ms 10588 KB Output is correct
7 Correct 1 ms 10588 KB Output is correct
8 Correct 1 ms 10704 KB Output is correct
9 Correct 1 ms 10584 KB Output is correct
10 Correct 2 ms 10588 KB Output is correct
11 Correct 1 ms 10584 KB Output is correct
12 Correct 2 ms 10588 KB Output is correct
13 Correct 1 ms 10588 KB Output is correct
14 Correct 1 ms 10588 KB Output is correct
15 Correct 1 ms 10708 KB Output is correct
16 Correct 2 ms 10588 KB Output is correct
17 Correct 1 ms 10588 KB Output is correct
18 Correct 1 ms 10588 KB Output is correct
19 Correct 1 ms 10588 KB Output is correct
20 Correct 2 ms 10588 KB Output is correct
21 Incorrect 1 ms 10588 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

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

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 10584 KB Output is correct
2 Correct 1 ms 10584 KB Output is correct
3 Correct 1 ms 10588 KB Output is correct
4 Correct 1 ms 10588 KB Output is correct
5 Correct 1 ms 10840 KB Output is correct
6 Correct 2 ms 10588 KB Output is correct
7 Correct 2 ms 10840 KB Output is correct
8 Correct 2 ms 10588 KB Output is correct
9 Correct 1 ms 10588 KB Output is correct
10 Correct 1 ms 10588 KB Output is correct
11 Correct 1 ms 10588 KB Output is correct
12 Correct 1 ms 10588 KB Output is correct
13 Correct 1 ms 10588 KB Output is correct
14 Correct 1 ms 10588 KB Output is correct
15 Correct 1 ms 10588 KB Output is correct
16 Correct 1 ms 10588 KB Output is correct
17 Correct 2 ms 10588 KB Output is correct
18 Correct 1 ms 10696 KB Output is correct
19 Correct 1 ms 10840 KB Output is correct
20 Correct 1 ms 10588 KB Output is correct
21 Incorrect 1 ms 10588 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 10588 KB Output is correct
2 Correct 1 ms 10588 KB Output is correct
3 Correct 1 ms 10588 KB Output is correct
4 Correct 2 ms 10588 KB Output is correct
5 Correct 1 ms 10588 KB Output is correct
6 Correct 1 ms 10588 KB Output is correct
7 Correct 1 ms 10588 KB Output is correct
8 Correct 2 ms 10704 KB Output is correct
9 Correct 1 ms 10584 KB Output is correct
10 Correct 2 ms 10584 KB Output is correct
11 Correct 1 ms 10588 KB Output is correct
12 Correct 1 ms 10588 KB Output is correct
13 Correct 1 ms 10588 KB Output is correct
14 Correct 1 ms 10588 KB Output is correct
15 Correct 1 ms 10588 KB Output is correct
16 Correct 1 ms 10588 KB Output is correct
17 Correct 1 ms 10696 KB Output is correct
18 Correct 2 ms 10588 KB Output is correct
19 Correct 2 ms 10584 KB Output is correct
20 Correct 2 ms 10588 KB Output is correct
21 Incorrect 2 ms 10588 KB Output isn't correct
22 Halted 0 ms 0 KB -