oj.uz

답안 #717790

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
717790 2023-04-02T14:21:08 Z skyvn97 육각형 영역 (APIO21_hexagon) C++14
0 / 100
 1 ms 212 KB 
#include "hexagon.h"

#include <bits/stdc++.h>
using namespace std;

long long a[22][7]; // memory limit exceeded

int draw_territory(int N, int A, int B,
                   std::vector<int> D, std::vector<int> L) {
	for (int i = 0; i < 100; i++) for (int j = 0; j < 100; j++) a[i][j] = i ^ j;
  	return a[0][0] + 220797;
}

Compilation message

hexagon.cpp: In function 'int draw_territory(int, int, int, std::vector<int>, std::vector<int>)':
hexagon.cpp:10:70: warning: iteration 7 invokes undefined behavior [-Waggressive-loop-optimizations]
   10 |  for (int i = 0; i < 100; i++) for (int j = 0; j < 100; j++) a[i][j] = i ^ j;
      |                                                              ~~~~~~~~^~~~~~~
hexagon.cpp:10:50: note: within this loop
   10 |  for (int i = 0; i < 100; i++) for (int j = 0; j < 100; j++) a[i][j] = i ^ j;
      |                                                ~~^~~~~
hexagon.cpp:10:70: warning: iteration 22 invokes undefined behavior [-Waggressive-loop-optimizations]
   10 |  for (int i = 0; i < 100; i++) for (int j = 0; j < 100; j++) a[i][j] = i ^ j;
      |                                                              ~~~~~~~~^~~~~~~
hexagon.cpp:10:20: note: within this loop
   10 |  for (int i = 0; i < 100; i++) for (int j = 0; j < 100; j++) a[i][j] = i ^ j;
      |                  ~~^~~~~

Subtask #1
0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -