Submission #58504

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
58504	2018-07-18 04:27:23	ngkan146	Horses (IOI15_horses)	C++11	100 / 100	1116 ms	62524 KiB

horses

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include "horses.h"
#include <bits/stdc++.h>
#define ll long long
using namespace std;
typedef pair<int,int> ii;
const ll mod = (ll) 1e9+7;
struct segTreeMul{
    ll node[2000005];
    segTreeMul(){
        for(int i=1;i<=2000000;i++) node[i] = 1;
    }
    void upd(int id,int l,int r,int pos,int val){
        if (r < pos || pos < l) return;
        if (l == r){
            node[id] = val;
            return;
        }
        upd(2*id,l,(l+r)/2,pos,val);
        upd(2*id+1,(l+r)/2+1,r,pos,val);
        node[id] = node[2*id] * node[2*id+1] % mod;
    }
    ll get(int id,int l,int r,int u,int v){
        if (r < u || v < l) return 1;
        if (u <= l && r <= v)   return node[id];
        return get(2*id, l, (l+r)/2, u, v) * get(2*id+1, (l+r)/2+1, r, u, v) % mod;
    }
};
struct segTreeMax{
    ll node[2000005];
    segTreeMax(){
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

Compilation message (stderr)

horses.cpp: In function 'long long int getBest()':
horses.cpp:78:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=1;i<importants.size();i++){
                 ~^~~~~~~~~~~~~~~~~~
horses.cpp:80:19: warning: conversion to 'double' from 'long long int' may alter its value [-Wconversion]
         if (1.0 * ma / denominator > bestRatio){
                   ^~
horses.cpp:80:24: warning: conversion to 'double' from 'long long int' may alter its value [-Wconversion]
         if (1.0 * ma / denominator > bestRatio){
                        ^~~~~~~~~~~
horses.cpp:82:31: warning: conversion to 'double' from 'long long int' may alter its value [-Wconversion]
             bestRatio = 1.0 * ma / denominator;
                               ^~
horses.cpp:82:36: warning: conversion to 'double' from 'long long int' may alter its value [-Wconversion]
             bestRatio = 1.0 * ma / denominator;
                                    ^~~~~~~~~~~
horses.cpp: In function 'int init(int, int*, int*)':
horses.cpp:100:16: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
  return getBest();
         ~~~~~~~^~
horses.cpp: In function 'int updateX(int, int)':
horses.cpp:109:16: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
  return getBest();
         ~~~~~~~^~
horses.cpp: In function 'int updateY(int, int)':
horses.cpp:115:16: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
  return getBest();
         ~~~~~~~^~

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