Submission #3695670


Source Code Expand

#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <map>
#include <deque>
#include <string.h>
using namespace std;

#define REP(i,n) for(int i = 0; i < n; i++)
#define ALL(v) v.begin(),v.end()
typedef long long ll;
typedef pair<int,int> pi;
typedef pair<ll,ll> pll;
typedef pair<string,string> pss;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pi> vpi;
typedef vector<ll> vll;
typedef vector<vll> vvll;

double EPS = 1e-9;
int INFi = 1000000005;
long long INFll = 1000000000000000005ll;
double PI = acos(-1);
int dirx[8] = {-1,0,0,1,-1,-1,1,1};
int diry[8] = {0,1,-1,0,-1,1,-1,1};
ll MOD = 1000000007;

const int MAX_N = 50;
int n;
int a[MAX_N];

int main(){
  cin >> n;
  REP(i, n) cin >> a[i];

  int max_i = 0, max_v = 0;
  REP(i, n) {
    if(abs(a[i]) > max_v) {
      max_i = i;
      max_v = abs(a[i]);
    }
  }

  cout << 2 * n - 1 << endl;

  REP(i, n) {
    a[i] += a[max_i];
    cout << max_i + 1 << " " <<  i + 1 << endl;
  }

  if(a[max_i] >= 0) {
    REP(i, n - 1) {
      if(a[i] > a[i + 1]) {
        a[i + 1] += a[i];
        cout << i + 1 << " " << i + 2 << endl;
      }
      else cout << i + 2 << " " << i + 2 << endl;
    }
  } else {
    REP(i, n - 1) {
      if(a[n - 2 - i] > a[n - 1 - i]) {
        a[i + 1] += a[i];
        cout << n - i << " " << n - i - 1 << endl;
      }
      else cout << n - 1 - i << " " << n - 1 - i << endl;
    }
  }


  return 0;
}

Submission Info

Submission Time
Task D - Non-decreasing
User yacropolisy
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1549 Byte
Status WA
Exec Time 2 ms
Memory 256 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 600
Status
AC × 3
AC × 25
WA × 17
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 WA 1 ms 256 KB
02.txt WA 2 ms 256 KB
03.txt WA 1 ms 256 KB
04.txt AC 1 ms 256 KB
05.txt WA 1 ms 256 KB
06.txt WA 1 ms 256 KB
07.txt WA 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 WA 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 WA 1 ms 256 KB
17.txt WA 1 ms 256 KB
18.txt WA 1 ms 256 KB
19.txt AC 1 ms 256 KB
20.txt AC 1 ms 256 KB
21.txt WA 1 ms 256 KB
22.txt WA 1 ms 256 KB
23.txt AC 1 ms 256 KB
24.txt AC 1 ms 256 KB
25.txt WA 1 ms 256 KB
26.txt AC 1 ms 256 KB
27.txt WA 1 ms 256 KB
28.txt AC 1 ms 256 KB
29.txt WA 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 WA 1 ms 256 KB
37.txt WA 1 ms 256 KB
38.txt AC 1 ms 256 KB
39.txt AC 1 ms 256 KB