Submission #2205649


Source Code Expand

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

using ll = long long;
using P = pair<int, int>;

const int INF = 1e9;
const int MOD = 1e9 + 7;

// 4近傍、8近傍
int dx[] = {1, 0, -1, 0, 1, -1, -1, 1};
int dy[] = {0, 1, 0, -1, 1, 1, -1, -1};

int x[110];
int y[110];

int main() {
  // 入力
  int N;
  cin >> N;
  int a[N];
  for (int i = 0; i < N; i++) cin >> a[i];

  P mini = P(INF, -1);
  P maxi = P(-INF, -1);
  for (int i = 0; i < N; i++) {
    if (mini.first > a[i]) {
      mini = P(a[i], i);
    }
    if (maxi.first < a[i]) {
      maxi = P(a[i], i);
    }
  }

  int m = 0;
  // 非負と負が混在していたらどちらかに統一
  if (mini.first < 0 && maxi.first >= 0) {
    if (maxi.first >= -mini.first) {
      for (int i = 0; i < N; i++) {
        x[m] = maxi.second;
        y[m] = i;
        m++;
      }
      mini.first = 0;
    } else {
      for (int i = 0; i < N; i++) {
        x[m] = mini.second;
        y[m] = i;
        m++;
      }
      maxi.first = -1;
    }
  }

  // 非負か負かで場合分けをして累積和をとる
  if (maxi.first >= 0 && mini.first >= 0) {
    for (int i = 1; i < N; i++) {
      x[m] = i - 1;
      y[m] = i;
      m++;
    }
  } else {
    for (int i = N - 2; i >= 0; i--) {
      x[m] = i + 1;
      y[m] = i;
      m++;
    }
  }

  // 解答
  cout << m << endl;
  for (int i = 0; i < m; i++) {
    cout << x[i] + 1 << " " << y[i] + 1 << endl;
  }

  return 0;
}

Submission Info

Submission Time
Task D - Non-decreasing
User university
Language C++14 (GCC 5.4.1)
Score 600
Code Size 1519 Byte
Status AC
Exec Time 1 ms
Memory 256 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 600 / 600
Status
AC × 3
AC × 42
Set Name Test Cases
Sample 00_example_01.txt, 00_example_02.txt, 00_example_03.txt
All 00_example_01.txt, 00_example_02.txt, 00_example_03.txt, 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 30.txt, 31.txt, 32.txt, 33.txt, 34.txt, 35.txt, 36.txt, 37.txt, 38.txt, 39.txt
Case Name Status Exec Time Memory
00_example_01.txt AC 1 ms 256 KB
00_example_02.txt AC 1 ms 256 KB
00_example_03.txt AC 1 ms 256 KB
01.txt AC 1 ms 256 KB
02.txt AC 1 ms 256 KB
03.txt AC 1 ms 256 KB
04.txt AC 1 ms 256 KB
05.txt AC 1 ms 256 KB
06.txt AC 1 ms 256 KB
07.txt AC 1 ms 256 KB
08.txt AC 1 ms 256 KB
09.txt AC 1 ms 256 KB
10.txt AC 1 ms 256 KB
11.txt AC 1 ms 256 KB
12.txt AC 1 ms 256 KB
13.txt AC 1 ms 256 KB
14.txt AC 1 ms 256 KB
15.txt AC 1 ms 256 KB
16.txt AC 1 ms 256 KB
17.txt AC 1 ms 256 KB
18.txt AC 1 ms 256 KB
19.txt AC 1 ms 256 KB
20.txt AC 1 ms 256 KB
21.txt AC 1 ms 256 KB
22.txt AC 1 ms 256 KB
23.txt AC 1 ms 256 KB
24.txt AC 1 ms 256 KB
25.txt AC 1 ms 256 KB
26.txt AC 1 ms 256 KB
27.txt AC 1 ms 256 KB
28.txt AC 1 ms 256 KB
29.txt AC 1 ms 256 KB
30.txt AC 1 ms 256 KB
31.txt AC 1 ms 256 KB
32.txt AC 1 ms 256 KB
33.txt AC 1 ms 256 KB
34.txt AC 1 ms 256 KB
35.txt AC 1 ms 256 KB
36.txt AC 1 ms 256 KB
37.txt AC 1 ms 256 KB
38.txt AC 1 ms 256 KB
39.txt AC 1 ms 256 KB