답안 #923698

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
923698 2024-02-07T15:18:05 Z alexdd Super Dango Maker (JOI22_dango3) C++17
7 / 100
224 ms 720 KB
#include "dango3.h"
#include <bits/stdc++.h>
using namespace std;
int n,m;
vector<int> ord;
vector<int> favec(vector<int> cv, int mij)
{
    vector<int> aux = cv;
    for(int j=0;j<=mij;j++)
        aux.push_back(ord[j]);
    return aux;
}
void scoate_unu()
{
    int ult = ord.size();
    vector<int> cv;
    for(int i=1;i<=n;i++)
    {
        int st,dr,mij,ans=ult-1;
        if(i==ult || !Query(favec(cv,ult-2)))
            ans=ult-1;
        else
        {
            st=0;
            dr=ult-1;
            while(st<=dr)
            {
                mij=(st+dr)/2;

                if(Query(favec(cv,mij)))
                {
                    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 0 ms 344 KB Output is correct
2 Correct 0 ms 600 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 352 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 344 KB Output is correct
2 Correct 3 ms 344 KB Output is correct
3 Correct 9 ms 348 KB Output is correct
4 Correct 12 ms 352 KB Output is correct
5 Correct 1 ms 352 KB Output is correct
6 Correct 1 ms 356 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 42 ms 608 KB Output is correct
2 Correct 47 ms 628 KB Output is correct
3 Incorrect 224 ms 644 KB Wrong Answer [3]
4 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 148 ms 720 KB Wrong Answer [3]
2 Halted 0 ms 0 KB -