oj.uz

Submission #923263

# Submission time Handle Problem Language Result Execution time Memory
923263 2024-02-07T04:04:44 Z Roumak77 Arranging Shoes (IOI19_shoes) C++17
15 / 100
 15 ms 3420 KB 
#pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
#pragma GCC optimize("-Ofast")
#include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <vector>
#include <limits>
#include <cmath>
#include <stack>
#include <queue>
#include <map>
#include <math.h>
using namespace std;
 
using ll = long long;
int64_t count_swaps(vector<int> shoes){
 
    ll length = shoes.size();
    /*vector<bool> list_n(length, 0);
 
    ll total = 0;
 
    for(int i = 0; i < length; i++){
        if(list_n[i] == 1){
            continue;
        }
 
        ll curr_counter = 0;
 
        ll curr_val = shoes[i];
 
        if(curr_val > 0){
            curr_counter++;
        }
 
 
 
        for(int j = i + 1; j < length; j++){
            //cout << curr_counter << ", i = " << i << ", j = " << j << endl;
            if(shoes[j] == -1 * curr_val && list_n[j] == 0){
                list_n[j] = 1;
                break;
            }else{
                if(list_n[j] == 0){
                    curr_counter++;
                }
            }
 
        }
 
        list_n[i] = 1;
 
        //cout << "curr_counter = " << curr_counter << ", i = " << i << endl;
 
 
        total += curr_counter;
 
        for(int k = 0; k < length; k++){
            cout << list_n[k] << " ";
        }
        cout << endl;
 
    }
 
    return total;
     */
 
    return (ll) (length/2 - 1)*(length/2)/2;
 
 
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 15 ms 1996 KB Output is correct
6 Correct 15 ms 3160 KB Output is correct
7 Correct 15 ms 3140 KB Output is correct
8 Correct 15 ms 3420 KB Output is correct
9 Correct 14 ms 3244 KB Output is correct
10 Correct 15 ms 3160 KB Output is correct

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -