답안 #905092

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
905092 2024-01-12T14:33:28 Z Ahmed57 Super Dango Maker (JOI22_dango3) C++17
22 / 100
212 ms 660 KB
#include "dango3.h"

#include <bits/stdc++.h>
using namespace std;

void Solve(int n,int m){
    int taked[n*m+1] = {0};
    for(int i = 0;i<m;i++){
        vector<int> lol;
        for(int j = 1;j<=n*m;j++){
            if(taked[j]==0){
                lol.push_back(j);
            }
        }
        vector<int> ans;
        int mi = lol.size()-1;
        for(int j = 1;j<=n;j++){
            int l = 0 , r = mi , an = 0;
            while(l<=r){
                int mid = (l+r)/2;
                vector<int> ex;
                for(auto i:ans)ex.push_back(i);
                for(int j = 0;j<=mid;j++){
                    ex.push_back(lol[j]);
                }
                if(Query(ex)>=1){
                    an = mid;
                    r = mid-1;
                }else l = mid+1;
            }
            mi = min(mi,an-1);
            ans.push_back(lol[an]);
        }
        for(auto i:ans)taked[i] = 1;
        Answer(ans);
    }
}
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 348 KB Output is correct
2 Correct 7 ms 348 KB Output is correct
3 Correct 9 ms 344 KB Output is correct
4 Correct 9 ms 344 KB Output is correct
5 Correct 4 ms 344 KB Output is correct
6 Correct 5 ms 348 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 53 ms 560 KB Output is correct
2 Correct 52 ms 344 KB Output is correct
3 Correct 208 ms 616 KB Output is correct
4 Correct 212 ms 604 KB Output is correct
5 Correct 32 ms 344 KB Output is correct
6 Correct 34 ms 344 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Incorrect 149 ms 660 KB Wrong Answer [3]
2 Halted 0 ms 0 KB -