Submission #7648198


Source Code Expand

#include<iostream>
#include<math.h>
#include<vector>
#include<algorithm>
#include<numeric>
#include<map>
#include<queue>
#include<deque>
#include<set>
#include<cstdio>
#include<cstring>
#include<string>
using namespace std;
typedef long long ll;
typedef vector<int> vec;
typedef vector<vector<int>> mat;

int main(){
    vec x,y;
    int N;cin>>N;
    int a[60];
    int M=-1,m=1,i_M=0,i_m=0;
    for(int i=1;i<=N;i++){
        cin>>a[i];
        if(a[i]>=0){
            if(a[i]>M){
                M=a[i];
                i_M=i;
            }
        }
        else{
            if(a[i]<m){
                m=a[i];
                i_m=i;
            }
        }
    }
    
    if(M==-1){
        int i=N-1;
        while(i>=1){
            if(a[i]>a[i+1]){
                a[i]+=a[i+1];
                x.push_back(i+1);
                y.push_back(i);
            }
            i--;
        }
    }
    else if(m==1){
        for(int i=1;i<N;i++){
            if(a[i]>a[i+1]){
                a[i+1]+=a[i];
                x.push_back(i);
                y.push_back(i+1);
            }
        }
    }
    else if(M>=-m){
        for(int i=1;i<=N;i++){
            if(a[i]<0){
                a[i]+=M;
                x.push_back(i_M);
                y.push_back(i);
            }
        }
        for(int i=1;i<N;i++){
            if(a[i]>a[i+1]){
                a[i+1]+=a[i];
                x.push_back(i);
                y.push_back(i+1);
            }
        }
    }
    else{
        for(int i=1;i<=N;i++){
            if(a[i]>0){
                a[i]+=m;
                x.push_back(i_m);
                y.push_back(i);
            }
        }
        int i=N-1;
        while(i>=1){
            if(a[i]>a[i+1]){
                a[i]+=a[i+1];
                x.push_back(i+1);
                y.push_back(i);
            }
            i--;
        }
    }

    cout<<x.size()<<endl;
    for(int i=0;i<x.size();i++)
        cout<<x[i]<<" "<<y[i]<<endl;
    return 0;  
}

Submission Info

Submission Time
Task D - Non-decreasing
User tani1220
Language C++14 (GCC 5.4.1)
Score 600
Code Size 2083 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