Submission #262400

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
262400	2020-08-12 21:03:39	uacoder123	Horses (IOI15_horses)	C++14	100 / 100	987 ms	104056 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 <bits/stdc++.h>
    #include "horses.h"
using namespace std;
#define F first
#define S second
#define FOR(i,a,b) for (auto i = (a); i <= (b); ++i)
#define NFOR(i,a,b) for(auto i = (a); i >= (b); --i)
#define all(x) (x).begin(), (x).end()
#define sz(x) lli(x.size())
#define mp(i,a) make_pair(i,a)
#define pb(a) push_back(a)
#define bit(x,b) (x&(1LL<<b))
typedef long long int lli;
typedef pair <lli,lli> ii;
typedef pair <lli,ii> iii;
typedef vector <lli> vi;
pair<lli,int> segt[2000001],segt1[2000001];;
lli lazy[2000001],arr1[500001],arr2[500001];
lli n,mod=1000000007;
lli p(lli a)
{
  lli b=0,ans=1;
  while((1LL<<b)<=mod-2)
  {
    if(bit(mod-2,b))
      ans=(ans*a)%mod;
    a=(a*a)%mod;
    b++;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

Compilation message (stderr)

horses.cpp: In function 'lli p(lli)':
horses.cpp:27:15: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
   27 |     if(bit(mod-2,b))
      |            ~~~^~
horses.cpp:12:19: note: in definition of macro 'bit'
   12 | #define bit(x,b) (x&(1LL<<b))
      |                   ^
horses.cpp: In function 'void up(lli, lli, lli, lli, lli, lli)':
horses.cpp:52:20: warning: conversion from 'lli' {aka 'long long int'} to 'int' may change value [-Wconversion]
   52 |       segt[node].S=l;
      |                    ^
horses.cpp: In function 'void up1(int, int, int, int)':
horses.cpp:89:22: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   89 |     segt1[node].S=min(mod,min(mod,min(mod,segt1[2*node+1].S*segt1[2*node+2].F)*segt1[2*node+2].S)*arr1[segt[2*node+2].S]);
      |                   ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
horses.cpp: In function 'int init(int, int*, int*)':
horses.cpp:119:14: warning: conversion from 'lli' {aka 'long long int'} to 'int' may change value [-Wconversion]
  119 |     up1(0,0,n-1,i);
      |             ~^~
horses.cpp:119:17: warning: conversion from 'lli' {aka 'long long int'} to 'int' may change value [-Wconversion]
  119 |     up1(0,0,n-1,i);
      |                 ^
horses.cpp:4:11: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
    4 | #define F first
      |           ^
horses.cpp:121:18: note: in expansion of macro 'F'
  121 |   return segt[0].F;
      |                  ^
horses.cpp: In function 'int updateX(int, int)':
horses.cpp:130:12: warning: conversion from 'lli' {aka 'long long int'} to 'int' may change value [-Wconversion]
  130 |   up1(0,0,n-1,pos);
      |           ~^~
horses.cpp:4:11: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
    4 | #define F first
      |           ^
horses.cpp:131:18: note: in expansion of macro 'F'
  131 |   return segt[0].F;
      |                  ^
horses.cpp: In function 'int updateY(int, int)':
horses.cpp:139:12: warning: conversion from 'lli' {aka 'long long int'} to 'int' may change value [-Wconversion]
  139 |   up1(0,0,n-1,pos);
      |           ~^~
horses.cpp:4:11: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
    4 | #define F first
      |           ^
horses.cpp:140:18: note: in expansion of macro 'F'
  140 |   return segt[0].F;
      |                  ^
horses.cpp: In function 'int init(int, int*, int*)':
horses.cpp:103:14: warning: iteration 2000001 invokes undefined behavior [-Waggressive-loop-optimizations]
  103 |     segt[i].F=1;
      |     ~~~~~~~~~^~
horses.cpp:101:16: note: within this loop
  101 |   for(lli i=0;i<=2000001;++i)
      |               ~^~~~~~~~~

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