oj.uz

Submission #64756

# Submission time Handle Problem Language Result Execution time Memory
64756 2018-08-05T14:32:08 Z Kubalionzzale Horses (IOI15_horses) C++14
17 / 100
 33 ms 8608 KB 
#include "horses.h"
#include <algorithm>

int init(int n, int a[], int b[]) {

    long long int max = 0, cur = 1;

    for (int i = 0; i < n; ++i)
    {
        cur *= a[i];

        if (cur * b[i] > max)
        {
            max = cur * b[i];
        }
    }

    return max;
}

int updateX(int pos, int val) {
	return 0;
}

int updateY(int pos, int val) {
	return 0;
}

Compilation message

horses.cpp: In function 'int init(int, int*, int*)':
horses.cpp:18:12: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
     return max;
            ^~~
horses.cpp: In function 'int updateX(int, int)':
horses.cpp:21:17: warning: unused parameter 'pos' [-Wunused-parameter]
 int updateX(int pos, int val) {
                 ^~~
horses.cpp:21:26: warning: unused parameter 'val' [-Wunused-parameter]
 int updateX(int pos, int val) {
                          ^~~
horses.cpp: In function 'int updateY(int, int)':
horses.cpp:25:17: warning: unused parameter 'pos' [-Wunused-parameter]
 int updateY(int pos, int val) {
                 ^~~
horses.cpp:25:26: warning: unused parameter 'val' [-Wunused-parameter]
 int updateY(int pos, int val) {
                          ^~~

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 3 ms 492 KB Output is correct
3 Correct 2 ms 648 KB Output is correct
4 Correct 2 ms 648 KB Output is correct
5 Correct 3 ms 648 KB Output is correct
6 Correct 2 ms 648 KB Output is correct
7 Correct 2 ms 648 KB Output is correct
8 Correct 2 ms 648 KB Output is correct
9 Correct 2 ms 648 KB Output is correct
10 Correct 3 ms 648 KB Output is correct
11 Correct 2 ms 648 KB Output is correct
12 Correct 3 ms 648 KB Output is correct
13 Correct 3 ms 648 KB Output is correct
14 Correct 3 ms 648 KB Output is correct
15 Correct 2 ms 648 KB Output is correct
16 Correct 2 ms 648 KB Output is correct
17 Correct 3 ms 648 KB Output is correct
18 Correct 3 ms 648 KB Output is correct
19 Correct 3 ms 648 KB Output is correct
20 Correct 3 ms 648 KB Output is correct

Subtask #2
0 / 17.0

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

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 33 ms 8608 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

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

Subtask #5
0 / 23.0

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