oj.uz

답안 #971209

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
971209 2024-04-28T06:47:27 Z Abito Line Town (CCO23_day1problem3) C++17
0 / 25
 2 ms 2392 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define F first
#define S second
#define pb push_back
#define ppb pop_back
#define ep insert
#define endl '\n'
#define elif else if
#define pow pwr
#define sqrt sqrtt
//#define int long long
#define ll long long
#define y1 YONE
#define free freeee
#define lcm llcm
typedef unsigned long long ull;
using namespace std;
const int N=5e5+5;
int a[N],n,b[N];
int32_t main(){
    ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
    cin>>n;
    for (int i=1;i<=n;i++) cin>>a[i];
    int op=0;
    for (int i=1;i<=n;i++){
        for (int j=1;j<n;j++){
            if (-a[j+1]<a[j]){
                swap(a[j],a[j+1]);
                a[j]=-a[j];
                a[j+1]=-a[j+1];
                op++;
            }
        }
        for (int j=1;j<=n;j++) cout<<a[j]<<' ';cout<<endl;
    }
    if (is_sorted(a+1,a+1+n)) cout<<op<<endl;
    else cout<<-1<<endl;
    return 0;
}

Compilation message

Main.cpp: In function 'int32_t main()':
Main.cpp:35:9: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   35 |         for (int j=1;j<=n;j++) cout<<a[j]<<' ';cout<<endl;
      |         ^~~
Main.cpp:35:48: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   35 |         for (int j=1;j<=n;j++) cout<<a[j]<<' ';cout<<endl;
      |                                                ^~~~

Subtask #1
0 / 3.0

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

Subtask #2
0 / 3.0

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

Subtask #3
0 / 3.0

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

Subtask #4
0 / 4.0

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

Subtask #5
0 / 4.0

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

Subtask #6
0 / 3.0

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

Subtask #7
0 / 2.0

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

Subtask #8
0 / 3.0

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