답안 #658927

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
658927	2022-11-15T12:42:44 Z	Jeff12345121	말 (IOI15_horses)	C++14	17 / 100	13 ms	8532 KB

horses

#include <bits/stdc++.h>
#include "horses.h"

#define REP(i,n) for(int i = 1; i <= (n); i++)
using namespace std;

#ifdef LOCAL
ifstream in("in.in");
ofstream out("out.out");
#endif

const int nmax = 1005;
long long n,x[nmax],y[nmax],inf = (1LL << 60),MOD = 1000000007;

int init(int tn, int* tx,int* ty) {
    n = tn;
    for (int i = 0; i < n; i++) {
        x[i] = tx[i];
        y[i] = ty[i];
    }

    long long horses = 1,max_sol = -inf;
    for (int i = 0; i < n; i++) {
        horses = 1LL * horses * x[i];
        max_sol = max(1LL * max_sol , 1LL * horses * y[i]);
    }

    return  max_sol % MOD;
}
int updateX(int pos, int val) {
    x[pos] = val;
    long long horses = 1,max_sol = -inf;
    for (int i = 0; i < n; i++) {
        horses = 1LL * horses * x[i];
        max_sol = max(1LL * max_sol , 1LL * horses * y[i]);
    }

    return  max_sol % MOD;
}

int updateY(int pos, int val) {
    y[pos] = val;
    long long horses = 1,max_sol = -inf;
    for (int i = 0; i < n; i++) {
        horses = 1LL * horses * x[i];
        max_sol = max(1LL * max_sol , 1LL * horses * y[i]);
    }

    return  max_sol % MOD;
}
#ifdef LOCAL
/*int tx[nmax],ty[nmax];
int32_t main() {
    in >> n;
    for (int i = 0; i < n; i++) {
        in >> tx[i];
    }
    for (int i = 0; i < n; i++) {
        in >> ty[i];
    }

    out << init(n,tx,ty) << "\n";
    int m;
    in >> m;
    for (int i = 0; i < m; i++) {
        int type,pos,val;
        in >> type >> pos >> val;
        if (type == 0) {
            out << updateX(pos, val);
        }
        if (type == 1) {
            out << updateY(pos,val);
        }
    }
}*/
#endif

Compilation message

horses.cpp: In function 'int init(int, int*, int*)':
horses.cpp:28:21: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   28 |     return  max_sol % MOD;
      |             ~~~~~~~~^~~~~
horses.cpp: In function 'int updateX(int, int)':
horses.cpp:38:21: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   38 |     return  max_sol % MOD;
      |             ~~~~~~~~^~~~~
horses.cpp: In function 'int updateY(int, int)':
horses.cpp:49:21: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   49 |     return  max_sol % MOD;
      |             ~~~~~~~~^~~~~

Subtask #1
17.0 / 17.0

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

Subtask #2
0 / 17.0

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

Subtask #3
0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Runtime error	13 ms	8532 KB	Execution killed with signal 11
2	Halted	0 ms	0 KB	-

Subtask #4
0 / 23.0

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

Subtask #5
0 / 23.0

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

답안 #658927

Compilation message

Subtask #1 17.0 / 17.0

Subtask #2 0 / 17.0

Subtask #3 0 / 20.0

Subtask #4 0 / 23.0

Subtask #5 0 / 23.0

Subtask #1
17.0 / 17.0

Subtask #2
0 / 17.0

Subtask #3
0 / 20.0

Subtask #4
0 / 23.0

Subtask #5
0 / 23.0