提出 #76407107

ソースコード 拡げる

#include<bits/stdc++.h>
using namespace std;
struct node{int id,s;};
queue<node>q;
const int maxn=1e6;
int Rank[maxn];
int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);cout.tie(nullptr);
    int n;cin>>n;
    for(int i=1;i<=n;i++){
        int x;cin>>x;
        q.push({i,x});
    }
    int Count=0;
    while(!q.empty()){
        Count++;
        int x,y,ix,iy;
        x=q.front().s;
        ix=q.front().id;
        q.pop();
        if(!q.empty()){
            y=q.front().s;
            iy=q.front().id;
            q.pop();
            if(x<y){
                q.push({iy,y});
                Rank[ix]=floor(log2(n))-floor(log2(n-Count));
            }
            else{
                q.push({ix,x});
                Rank[iy]=floor(log2(n))-floor(log2(n-Count));
            }
        }
    }
    for(int i=1;i<=n;i++)
        cout<<Rank[i]<<' ';
    return 0;
}

提出情報

提出日時
問題 A - トーナメント敗退ラウンド
ユーザ pan_ye
言語 C++23 (GCC 15.2.0)
得点 266
コード長 924 Byte
結果 AC
実行時間 41 ms
メモリ 9880 KiB

ジャッジ結果

セット名 Sample All
得点 / 配点 0 / 0 266 / 266
結果
AC × 5
AC × 74
セット名 テストケース
Sample sample01.txt, sample02.txt, sample03.txt, sample04.txt, sample05.txt
All sample01.txt, sample02.txt, sample03.txt, sample04.txt, sample05.txt, in01.txt, in02.txt, in03.txt, in04.txt, in05.txt, in06.txt, in07.txt, in08.txt, in09.txt, in10.txt, in11.txt, in12.txt, in13.txt, in14.txt, in15.txt, in16.txt, in17.txt, in18.txt, in19.txt, in20.txt, in21.txt, in22.txt, in23.txt, in24.txt, in25.txt, in26.txt, in27.txt, in28.txt, in29.txt, in30.txt, in31.txt, in32.txt, in33.txt, in34.txt, in35.txt, in36.txt, in37.txt, in38.txt, in39.txt, in40.txt, in41.txt, in42.txt, in43.txt, in44.txt, in45.txt, in46.txt, in47.txt, in48.txt, in49.txt, in50.txt, in51.txt, in52.txt, in53.txt, in54.txt, in55.txt, in56.txt, in57.txt, in58.txt, in59.txt, in60.txt, in61.txt, in62.txt, in63.txt, in64.txt, in65.txt, in66.txt, in67.txt, in68.txt, in69.txt
ケース名 結果 実行時間 メモリ
in01.txt AC 1 ms 3688 KiB
in02.txt AC 1 ms 3700 KiB
in03.txt AC 1 ms 3696 KiB
in04.txt AC 1 ms 3728 KiB
in05.txt AC 1 ms 3616 KiB
in06.txt AC 1 ms 3612 KiB
in07.txt AC 1 ms 3612 KiB
in08.txt AC 1 ms 3616 KiB
in09.txt AC 1 ms 3616 KiB
in10.txt AC 1 ms 3604 KiB
in11.txt AC 41 ms 9848 KiB
in12.txt AC 41 ms 9752 KiB
in13.txt AC 38 ms 9876 KiB
in14.txt AC 38 ms 9784 KiB
in15.txt AC 37 ms 9692 KiB
in16.txt AC 1 ms 3520 KiB
in17.txt AC 1 ms 3820 KiB
in18.txt AC 1 ms 3564 KiB
in19.txt AC 40 ms 9652 KiB
in20.txt AC 40 ms 9784 KiB
in21.txt AC 41 ms 9816 KiB
in22.txt AC 37 ms 9848 KiB
in23.txt AC 38 ms 9784 KiB
in24.txt AC 37 ms 9808 KiB
in25.txt AC 38 ms 9880 KiB
in26.txt AC 1 ms 3696 KiB
in27.txt AC 1 ms 3600 KiB
in28.txt AC 1 ms 3616 KiB
in29.txt AC 1 ms 3688 KiB
in30.txt AC 1 ms 3632 KiB
in31.txt AC 1 ms 3600 KiB
in32.txt AC 1 ms 3600 KiB
in33.txt AC 1 ms 3624 KiB
in34.txt AC 1 ms 3612 KiB
in35.txt AC 1 ms 3632 KiB
in36.txt AC 1 ms 3656 KiB
in37.txt AC 1 ms 3616 KiB
in38.txt AC 1 ms 3604 KiB
in39.txt AC 1 ms 3616 KiB
in40.txt AC 1 ms 3632 KiB
in41.txt AC 1 ms 3604 KiB
in42.txt AC 1 ms 3604 KiB
in43.txt AC 1 ms 3652 KiB
in44.txt AC 39 ms 9880 KiB
in45.txt AC 41 ms 9848 KiB
in46.txt AC 38 ms 9692 KiB
in47.txt AC 40 ms 9752 KiB
in48.txt AC 40 ms 9644 KiB
in49.txt AC 41 ms 9692 KiB
in50.txt AC 40 ms 9824 KiB
in51.txt AC 40 ms 9772 KiB
in52.txt AC 38 ms 9844 KiB
in53.txt AC 37 ms 9652 KiB
in54.txt AC 37 ms 9848 KiB
in55.txt AC 37 ms 9752 KiB
in56.txt AC 2 ms 3604 KiB
in57.txt AC 1 ms 3688 KiB
in58.txt AC 1 ms 3604 KiB
in59.txt AC 1 ms 3628 KiB
in60.txt AC 1 ms 3604 KiB
in61.txt AC 1 ms 3612 KiB
in62.txt AC 1 ms 3820 KiB
in63.txt AC 1 ms 3624 KiB
in64.txt AC 1 ms 3820 KiB
in65.txt AC 1 ms 3624 KiB
in66.txt AC 1 ms 3696 KiB
in67.txt AC 1 ms 3616 KiB
in68.txt AC 19 ms 6660 KiB
in69.txt AC 40 ms 9852 KiB
sample01.txt AC 1 ms 3628 KiB
sample02.txt AC 1 ms 3564 KiB
sample03.txt AC 1 ms 3700 KiB
sample04.txt AC 1 ms 3596 KiB
sample05.txt AC 1 ms 3600 KiB