# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
148432 | 2019-09-01T04:22:34 Z | 코딩은 체육과목입니다(#3561, jwvg0425, 16silver, jhuni) | 십자가 놓기 (FXCUP4_cross) | C++17 | 86 ms | 3692 KB |
#include "cross.h" #include <stdio.h> #include <vector> #include <queue> #include <algorithm> #include <iostream> #include <string> #include <bitset> #include <map> #include <set> #include <tuple> #include <string.h> #include <math.h> #include <random> #include <functional> #include <assert.h> #include <math.h> #define all(x) (x).begin(), (x).end() #define xx first #define yy second using namespace std; using i64 = long long int; using ii = pair<int, int>; using ii64 = pair<i64, i64>; long long SelectCross(int K, std::vector<int> I, std::vector<int> O) { i64 ans = 0; for (int i = 0; i < I.size(); i++) { i64 oi = O[i]; i64 ii = I[i]; ans = max(ans, 2 * oi * ii - ii * ii); } return ans; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 6 ms | 384 KB | Output is correct |
2 | Correct | 5 ms | 384 KB | Output is correct |
3 | Correct | 6 ms | 256 KB | Output is correct |
4 | Correct | 6 ms | 384 KB | Output is correct |
5 | Correct | 10 ms | 640 KB | Output is correct |
6 | Correct | 86 ms | 3688 KB | Output is correct |
7 | Correct | 86 ms | 3692 KB | Output is correct |
8 | Correct | 84 ms | 3692 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 6 ms | 384 KB | Output is correct |
2 | Correct | 5 ms | 384 KB | Output is correct |
3 | Correct | 6 ms | 256 KB | Output is correct |
4 | Correct | 6 ms | 384 KB | Output is correct |
5 | Correct | 10 ms | 640 KB | Output is correct |
6 | Correct | 86 ms | 3688 KB | Output is correct |
7 | Correct | 86 ms | 3692 KB | Output is correct |
8 | Correct | 84 ms | 3692 KB | Output is correct |
9 | Incorrect | 5 ms | 384 KB | Output isn't correct |
10 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 6 ms | 384 KB | Output is correct |
2 | Correct | 5 ms | 384 KB | Output is correct |
3 | Correct | 6 ms | 256 KB | Output is correct |
4 | Correct | 6 ms | 384 KB | Output is correct |
5 | Correct | 10 ms | 640 KB | Output is correct |
6 | Correct | 86 ms | 3688 KB | Output is correct |
7 | Correct | 86 ms | 3692 KB | Output is correct |
8 | Correct | 84 ms | 3692 KB | Output is correct |
9 | Incorrect | 5 ms | 384 KB | Output isn't correct |
10 | Halted | 0 ms | 0 KB | - |