답안 #923687

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
923687 2024-02-07T15:12:17 Z alexdd Super Dango Maker (JOI22_dango3) C++17
22 / 100
130 ms 876 KB
#include "dango3.h"
#include <bits/stdc++.h>
using namespace std;
int n,m;
vector<int> ord;
void scoate_unu()
{
    int ult = ord.size();
    vector<int> cv;
    for(int i=1;i<=n;i++)
    {
        int st,dr,mij,ans=ult-1;
        st=0;
        dr=ult-1;
        while(st<=dr)
        {
            mij=(st+dr)/2;
            vector<int> aux = cv;
            for(int j=0;j<=mij;j++)
                aux.push_back(ord[j]);
            if(Query(aux))
            {
                ans=mij;
                dr=mij-1;
            }
            else
                st=mij+1;
        }
        cv.push_back(ord[ans]);
        ult=ans;
        ord.erase(ord.begin()+ans);
    }
    Answer(cv);
}
void Solve(int N, int M)
{
    n=N;
    m=M;
    for(int i=1;i<=n*m;i++)
        ord.push_back(i);
    random_shuffle(ord.begin(),ord.end());
    for(int i=1;i<m;i++)
        scoate_unu();
    Answer(ord);
}
/**

3 2
3 3 1 2 1 2

*/
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 460 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 604 KB Output is correct
2 Correct 3 ms 348 KB Output is correct
3 Correct 3 ms 348 KB Output is correct
4 Correct 4 ms 348 KB Output is correct
5 Correct 4 ms 348 KB Output is correct
6 Correct 3 ms 348 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 43 ms 604 KB Output is correct
2 Correct 41 ms 876 KB Output is correct
3 Correct 43 ms 604 KB Output is correct
4 Correct 47 ms 856 KB Output is correct
5 Correct 42 ms 604 KB Output is correct
6 Correct 44 ms 604 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Incorrect 130 ms 600 KB Wrong Answer [3]
2 Halted 0 ms 0 KB -