oj.uz

답안 #590291

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
590291 2022-07-05T18:27:57 Z ioi Group Photo (JOI21_ho_t3) C++14
0 / 100
 1 ms 320 KB 
#include<bits/stdc++.h>

using namespace std;

#define debug(x) cout << '[' << #x << " is: " << x << "] " << endl;
#define inF freopen("cardgame.in" , "r" , stdin);
#define outF freopen("cardgame.out" , "w" , stdout);
#define imod(a , n) (a % n + n ) % n
#define sor(v) sort(v.begin() , v.end());
#define print(v) for(auto f : v ) cout << f << " " ;
#define rsor(v) sort(v.rbegin() , v.rend());
#define rev(v) reverse(v.begin() , v.end());
#define scan(v)for(auto &it : v)cin >> it ;
#define ll long long

#define logar(x , y) log(x) / log(y)
#define __sum(n) n * (n + 1) / 2
#define __lcm(a , b) a / __gcd(a , b) * b
#define pii pair<int , int >
#define fastio ios_base::sync_with_stdio(false);cin.tie(0);

#define int ll

const int N =  3e5 + 5 ,  M = N * 4  , MX = 2e4 + 40;
const ll MOD = 998244353  , oo = 1e9 + 9 , OO = 1e18 , mod = MOD ;
const double pi = acos(-1) , eps = 1e-17 ;

int di[] = {1 , -1 , 0 , 0};
int dj[] = {0 , 0 , 1 , -1};

struct data{
int a , b  , c ;

};

int32_t main()
{
    // inF;
   // inF;outF;
    fastio;

    //Welcome back without <TAWJIHI>


    int n ;
    cin >> n ;
    int ans = 0 ;
vector<int> v(n);
for(auto &it : v)cin >> it ;

for(int i = 0 ; i < n ; i ++){
    int j = i ;

    while(j && v[j] + 2 <= v[j - 1]){
        swap(v[j] , v[j - 1]);
        ans ++ ;
        j -- ;

    }
}


    cout << ans ;

}

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 320 KB Output is correct
2 Correct 1 ms 232 KB Output is correct
3 Incorrect 0 ms 320 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 320 KB Output is correct
2 Correct 1 ms 232 KB Output is correct
3 Incorrect 0 ms 320 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 320 KB Output is correct
2 Correct 1 ms 232 KB Output is correct
3 Incorrect 0 ms 320 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 320 KB Output is correct
2 Correct 1 ms 232 KB Output is correct
3 Incorrect 0 ms 320 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 320 KB Output is correct
2 Correct 1 ms 232 KB Output is correct
3 Incorrect 0 ms 320 KB Output isn't correct
4 Halted 0 ms 0 KB -