oj.uz

답안 #1040787

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1040787 2024-08-01T09:19:01 Z YassineBenYounes The Collection Game (BOI21_swaps) C++17
3 / 100
 29 ms 416 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 = 2e5+5;
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);
    }
}
 
vi visit(){
    vi v = cur;
    cur.clear();
    return v;
}*/
 
vi recur(vi v){
    if(v.size() == 1)return v;
    int md = v.size()/2;
    vi a, b;
    for(int i = 0; i < v.size();i++){
        if(i < md){
            a.pb(v[i]);
        }
        else{
            b.pb(v[i]);
        }
    }
    a = recur(a);
    b = recur(b);
    /*cout << v.size() << endl;
    for(int x : a){
        cout << x << " ";
    }
    cout << endl;
    for(int x : b){
        cout << x << " ";
    }
    cout << endl;*/
    /*for(int i = 0; i < a.size();i++){
        for(int j = 0;j < b.size();j++){
            schedule(a[i], b[j]);
        }
    }
    vi res = visit();*/
    int x = 0, y = 0;
    vi ans;
    while(x < a.size() && y < b.size()){
        schedule(a[x], b[y]);
        vi res = visit();
        int k = res[0];
        if(k == 1){
            ans.pb(a[x]);
            x++;
        }
        else{
            ans.pb(b[y]);
            y++;
        }
    }
    while(x < a.size()){
        ans.pb(a[x]);
        x++;
    }
    while(y < b.size()){
        ans.pb(b[y]);
        y++;
    }
    return ans;
}
 
void solve(int N, int v){
    n = N;
    vi x;
    for(int i = 1; i <= n;i++){
        x.pb(i);
    }
    for(int i = 1; i <= n;i++){
        for(int j = i+1;j <= n;j++){
            schedule(i, j);
            visit();
        }
    }
    /*for(int x : a){
        cout << x << " ";
    }
    cout << endl;*/
    answer(x);
}
/*
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 'std::vector<int> recur(std::vector<int>)':
swaps.cpp:83:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   83 |     for(int i = 0; i < v.size();i++){
      |                    ~~^~~~~~~~~~
swaps.cpp:110:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  110 |     while(x < a.size() && y < b.size()){
      |           ~~^~~~~~~~~~
swaps.cpp:110:29: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  110 |     while(x < a.size() && y < b.size()){
      |                           ~~^~~~~~~~~~
swaps.cpp:123:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  123 |     while(x < a.size()){
      |           ~~^~~~~~~~~~
swaps.cpp:127:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  127 |     while(y < b.size()){
      |           ~~^~~~~~~~~~
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
0.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Not correct
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 344 KB Not correct
2 Halted 0 ms 0 KB -

Subtask #3-1
3.0 / 3.0

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

Subtask #3-2
0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Correct
2 Correct 19 ms 344 KB Correct
3 Incorrect 1 ms 344 KB Not correct
4 Halted 0 ms 0 KB -

Subtask #4-1
0 / 9.0

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

Subtask #4-2
0 / 6.0

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

Subtask #5-1
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Correct
2 Correct 22 ms 344 KB Correct
3 Runtime error 24 ms 416 KB Execution killed with signal 13
4 Halted 0 ms 0 KB -

Subtask #5-2
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Correct
2 Correct 22 ms 344 KB Correct
3 Runtime error 24 ms 416 KB Execution killed with signal 13
4 Halted 0 ms 0 KB -

Subtask #6-1
0 / 21.0

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

Subtask #6-2
0 / 14.0

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

Subtask #7-1
0 / 9.0

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

Subtask #7-2
0 / 6.0

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