제출 #126568

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
126568	2019-07-08 06:03:53	E869120	Bubble Sort 2 (JOI18_bubblesort2)	C++14	60 / 100	9074 ms	12048 KiB

bubblesort2

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 "bubblesort2.h"
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
class RangeAddMaxSegmentTree {
public:
  vector<int> dat, lazy; int size_ = 1;
  void output() {
    cout << "dat : " << endl;
    for (int i = 1; i <= size_; i *= 2) {
      for (int j = i; j < i * 2; j++) {
        for (int k = 0; k < 5 * ((size_ / i) - 1); k++) cout << " ";
        cout << "[";
        if (dat[j] >= 0 && dat[j] <= 9) cout << "  " << dat[j];
        else if (dat[j] >= -9 && dat[j] <= 99) cout << " " << dat[j];
        else cout << dat[j];
        cout << "]";
        for (int k = 0; k < 5 * ((size_ / i) - 1); k++) cout << " ";
        cout << "     ";
      }
      cout << endl;
    }
    cout << endl;
    cout << "lazy : " << endl;
    for (int i = 1; i <= size_; i *= 2) {
      for (int j = i; j < i * 2; j++) {
        for (int k = 0; k < 5 * ((size_ / i) - 1); k++) cout << " ";
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

컴파일 시 표준 에러 (stderr) 메시지

bubblesort2.cpp: In member function 'void RangeAddMaxSegmentTree2::output()':
bubblesort2.cpp:94:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int i = 0; i < dat.size(); i++) printf("% 4d", dat[i]); cout << endl;
                   ~~^~~~~~~~~~~~
bubblesort2.cpp:94:3: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   for (int i = 0; i < dat.size(); i++) printf("% 4d", dat[i]); cout << endl;
   ^~~
bubblesort2.cpp:94:64: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   for (int i = 0; i < dat.size(); i++) printf("% 4d", dat[i]); cout << endl;
                                                                ^~~~
bubblesort2.cpp: In function 'std::vector<int> countScans(std::vector<int>, std::vector<int>, std::vector<int>)':
bubblesort2.cpp:145:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < G.size(); i++) {
                  ~~^~~~~~~~~~

• Subtask 1: 17 / 17
• Subtask 2: 21 / 21
• Subtask 3: 22 / 22
• Subtask 4: 0 / 40