oj.uz

답안 #1040853

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1040853 2024-08-01T10:46:59 Z YassineBenYounes The Collection Game (BOI21_swaps) C++17
25 / 100
 62 ms 832 KB 
#include<bits/stdc++.h>
//#include<chrono>
//#include<random>
#include "swaps.h"
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef double db;
ll gcd(ll a , ll b) {return b ? gcd(b , a % b) : a ;} // greatest common divisor (PGCD)
ll lcm(ll a , ll b) {return (a * b) / gcd(a , b);} // least common multiple (PPCM)
int dx[8] = {1, 0, 0, -1, 1, 1, -1, -1};
int dy[8] = {0, 1, -1, 0, 1, -1, -1, 1};
#define endl "\n"
#define ss second
#define ff first
#define all(x) (x).begin() , (x).end()
#define pb push_back
#define vi vector<int>
#define vii vector<pair<int,int>>
#define vl vector<ll>
#define vll vector<pair<ll,ll>>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pdd  pair<double,double>
#define vdd  vector<pdd>
#define speed ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pbds tree<pii, null_type, less<pii>,rb_tree_tag, tree_order_statistics_node_update>
using namespace __gnu_pbds;
using namespace std;
//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
 
////////////////////Only Clear Code//////////////////////////
 
void usaco_problem(){
    freopen("milkvisits.in", "r", stdin);
    freopen("milkvisits.out", "w", stdout);
}
 
void init(){
    #ifndef ONLINE_JUDGE
 
freopen("input.txt", "r", stdin);
 
freopen("output.txt", "w", stdout);
 
#endif // ONLINE_JUDGE
}
const int mx = 505;
const int LOG = 22;
const int inf = 1e9;
const ll mod = 1e9+7;
const int sq = 320;
int n;
/*
vi cur;
 
void schedule(int i, int j){
    if(i % 2 == 0){
        if(j % 2 == 0){
            cur.pb(i > j);
        }
        else{
            cur.pb(1);
        }
    }
    else{
        cur.pb(i > j);
    }
    //cur.pb(i > j);
}
 
vi visit(){
    vi v = cur;
    cur.clear();
    return v;
}
*/
bool taken[mx];

int recur(vi v){
    vi best;
    for(int x : v){
        best.pb(x);
    }
    while(best.size() > 1){
        for(int i = 0; (i+1) < best.size();i+=2){
            schedule(best[i], best[i+1]);
        }
        vi res = visit();
        vi nw;
        int ind = 0;
        for(int x : res){
            if(x == 1)nw.pb(best[ind]);
            else nw.pb(best[ind+1]);
            ind += 2;
        }
        if(ind < best.size())nw.pb(best[ind]);
        best = nw;
    }
    return best[0];
}

void solve(int N, int v){
    n = N;
    vector<vi> cluster;
    vi ans;
    for(int i = 0; i < n;i++){
        vi k;
        for(int j = 1; j <= n;j++){
            if(!taken[j])k.pb(j);
        }
        /*for(int x : k){
            cout << x << " ";
        }
        cout << endl;*/
        int x = recur(k);
        taken[x] = 1;
        ans.pb(x);
    }
    /*for(int x : ans){
        cout << x << " ";
    }
    cout << endl;*/
    answer(ans);
}
/*
int32_t main(){
    init();
    speed;
    solve(4, 50);
}*/
/*
    NEVER GIVE UP!
    DOING SMTHNG IS BETTER THAN DOING NTHNG!!!
    Your Guide when stuck:
    - Continue keyword only after reading the whole input
    - Don't use memset with testcases
    - Check for corner cases(n=1, n=0)
    - Check where you declare n(Be careful of declaring it globally and in main)
*/

Compilation message

swaps.cpp: In function 'int recur(std::vector<int>)':
swaps.cpp:88:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   88 |         for(int i = 0; (i+1) < best.size();i+=2){
      |                        ~~~~~~^~~~~~~~~~~~~
swaps.cpp:99:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   99 |         if(ind < best.size())nw.pb(best[ind]);
      |            ~~~~^~~~~~~~~~~~~
swaps.cpp: In function 'void usaco_problem()':
swaps.cpp:37:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   37 |     freopen("milkvisits.in", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
swaps.cpp:38:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   38 |     freopen("milkvisits.out", "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
swaps.cpp: In function 'void init()':
swaps.cpp:44:8: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   44 | freopen("input.txt", "r", stdin);
      | ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
swaps.cpp:46:8: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   46 | freopen("output.txt", "w", stdout);
      | ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Correct
2 Correct 4 ms 436 KB Correct
3 Correct 15 ms 608 KB Correct
4 Correct 41 ms 696 KB Correct
5 Correct 43 ms 524 KB Correct
6 Correct 46 ms 692 KB Correct
7 Correct 41 ms 452 KB Correct
8 Correct 41 ms 456 KB Correct

Subtask #2
0.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Correct
2 Correct 3 ms 344 KB Correct
3 Correct 16 ms 344 KB Correct
4 Correct 42 ms 452 KB Correct
5 Correct 60 ms 696 KB Correct
6 Correct 40 ms 704 KB Correct
7 Correct 54 ms 832 KB Correct
8 Correct 59 ms 452 KB Correct
9 Runtime error 13 ms 452 KB Execution killed with signal 13
10 Halted 0 ms 0 KB -

Subtask #3-1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Correct
2 Correct 3 ms 344 KB Correct

Subtask #3-2
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Correct
2 Correct 3 ms 344 KB Correct
3 Correct 0 ms 596 KB Correct
4 Correct 3 ms 436 KB Correct

Subtask #4-1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Correct
2 Correct 5 ms 344 KB Correct
3 Correct 16 ms 600 KB Correct
4 Correct 35 ms 500 KB Correct

Subtask #4-2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Correct
2 Correct 5 ms 344 KB Correct
3 Correct 16 ms 600 KB Correct
4 Correct 35 ms 500 KB Correct
5 Correct 0 ms 344 KB Correct
6 Correct 4 ms 344 KB Correct
7 Correct 12 ms 456 KB Correct
8 Correct 47 ms 592 KB Correct
9 Correct 53 ms 456 KB Correct
10 Correct 45 ms 452 KB Correct
11 Correct 35 ms 504 KB Correct
12 Correct 36 ms 448 KB Correct
13 Correct 0 ms 344 KB Correct
14 Correct 3 ms 344 KB Correct
15 Correct 11 ms 344 KB Correct
16 Correct 51 ms 452 KB Correct

Subtask #5-1
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Correct
2 Correct 3 ms 600 KB Correct
3 Correct 16 ms 704 KB Correct
4 Correct 62 ms 448 KB Correct
5 Runtime error 9 ms 588 KB Execution killed with signal 13
6 Halted 0 ms 0 KB -

Subtask #5-2
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Correct
2 Correct 3 ms 600 KB Correct
3 Correct 16 ms 704 KB Correct
4 Correct 62 ms 448 KB Correct
5 Runtime error 9 ms 588 KB Execution killed with signal 13
6 Halted 0 ms 0 KB -

Subtask #6-1
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Correct
2 Correct 3 ms 344 KB Correct
3 Correct 13 ms 436 KB Correct
4 Correct 42 ms 576 KB Correct
5 Runtime error 6 ms 344 KB Execution killed with signal 13
6 Halted 0 ms 0 KB -

Subtask #6-2
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Correct
2 Correct 3 ms 344 KB Correct
3 Correct 13 ms 436 KB Correct
4 Correct 42 ms 576 KB Correct
5 Runtime error 6 ms 344 KB Execution killed with signal 13
6 Halted 0 ms 0 KB -

Subtask #7-1
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Correct
2 Correct 3 ms 600 KB Correct
3 Correct 11 ms 448 KB Correct
4 Correct 48 ms 452 KB Correct
5 Runtime error 10 ms 344 KB Execution killed with signal 13
6 Halted 0 ms 0 KB -

Subtask #7-2
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Correct
2 Correct 3 ms 600 KB Correct
3 Correct 11 ms 448 KB Correct
4 Correct 48 ms 452 KB Correct
5 Runtime error 10 ms 344 KB Execution killed with signal 13
6 Halted 0 ms 0 KB -