oj.uz

답안 #1017389

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1017389 2024-07-09T07:41:57 Z yeediot Swap (BOI16_swap) C++17
100 / 100
 144 ms 30920 KB 
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define F first
#define S second
#define all(x) x.begin(),x.end()
#define pii pair<int,int>
#define pb push_back
#define sz(x) (int)(x.size())
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
#define vi vector<int>
#define vp vector<pii>
#define vvi vector<vi>
#define ykh mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count())
#define __lg(x) 63-__builtin_clzll(x)
#define pow2(x) (1LL<<x)
void __print(int x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifdef local
void CHECK();
void setio(){
    freopen("/Users/iantsai/cpp/input.txt","r",stdin);
    freopen("/Users/iantsai/cpp/output.txt","w",stdout);
}
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
void setio(){}
#define debug(x...)
#endif
#define TOI_is_so_de ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);setio();
const int mxn = 2e5 + 5;
int n, p[2 * mxn];
map<pair<int, int>, int>mp;
int get_pos(int id, int a){
    if(id > n) return 0;
    if(mp.count({id, a})) return mp[{id, a}];
    int &v = mp[{id, a}], b = p[id * 2], c = p[id * 2 + 1];
    if(a < b and a < c){
        return v = 0;
    }
    else if(b < c){
        return v = get_pos(id * 2, a) + 1;
    }
    else{
        if(b < a){
            int x = get_pos(id * 2, b), y = get_pos(id * 2 + 1, b);
            if(x <= y) return v = get_pos(id * 2 + 1, a) + 1;
            else if(x > y)return v = get_pos(id * 2, a) + 1;
            //else return v = min(get_pos(id * 2, a), get_pos(id * 2 + 1, a)) + 1;
        }
        else{
            return v = min(get_pos(id * 2, a), get_pos(id * 2 + 1, a)) + 1;
        }
    }
}
void go(int id){
    if(id > n) return;
    int &a = p[id], &b = p[id * 2], &c = p[id * 2 + 1];
    if(a < b and a < c){

    } 
    else if(b < c){
        swap(a, b);
    }
    else{
        swap(a, c);
        if(b > c){
            swap(b, c);
        }
        int x = get_pos(id * 2, b), y = get_pos(id * 2 + 1, b);
        if(x > y){
            swap(b, c);
        }
        else if(x == y){
            //if(get_pos(id * 2, c) < get_pos(id * 2 + 1, c)) swap(b, c);
        }
    }
    go(id * 2); go(id * 2 + 1);
}
void solve(){
    cin >> n;
    for(int i = 1; i <= n; i++) cin >> p[i];
    for(int i = n + 1; i <= 2 * n + 1; i++) p[i] = n + 1;
    go(1);
    for(int i = 1; i <= n; i++){
        cout << p[i] << " \n"[i == n];
    }
}
signed main(){
    TOI_is_so_de;
    int t = 1;
    //cin >> t;
    while(t--){
        solve();
    }
    #ifdef local
    CHECK();
    #endif
}
/*
input:
 
*/
#ifdef local
void CHECK(){
    cerr << "\n[Time]: " << 1000.0 * clock() / CLOCKS_PER_SEC << " ms.\n";
    function<bool(string,string)> compareFiles = [](string p1, string p2)->bool {
        std::ifstream file1(p1);
        std::ifstream file2(p2);
        if(!file1.is_open() || !file2.is_open()) return false;
        std::string line1, line2;
        while (getline(file1, line1) && getline(file2, line2)) {
            if (line1 != line2)return false;
        }
        int cnta = 0, cntb = 0;
        while(getline(file1,line1))cnta++;
        while(getline(file2,line2))cntb++;
        return cntb - cnta <= 1;
    };
    bool check = compareFiles("output.txt","expected.txt");
    if(check) cerr<<"ACCEPTED\n";
    else cerr<<"WRONG ANSWER!\n";
}
#else
#endif

Compilation message

swap.cpp: In function 'long long int get_pos(long long int, long long int)':
swap.cpp:70:1: warning: control reaches end of non-void function [-Wreturn-type]
   70 | }
      | ^

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct

Subtask #3
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 604 KB Output is correct

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 14 ms 5212 KB Output is correct
17 Correct 14 ms 5552 KB Output is correct
18 Correct 14 ms 5468 KB Output is correct
19 Correct 32 ms 7968 KB Output is correct
20 Correct 31 ms 9296 KB Output is correct

Subtask #5
32.0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 14 ms 5212 KB Output is correct
17 Correct 14 ms 5552 KB Output is correct
18 Correct 14 ms 5468 KB Output is correct
19 Correct 32 ms 7968 KB Output is correct
20 Correct 31 ms 9296 KB Output is correct
21 Correct 76 ms 15308 KB Output is correct
22 Correct 64 ms 15444 KB Output is correct
23 Correct 62 ms 15444 KB Output is correct
24 Correct 143 ms 30920 KB Output is correct
25 Correct 144 ms 30804 KB Output is correct