oj.uz

답안 #892631

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
892631 2023-12-25T15:40:24 Z Nurislam Super Dango Maker (JOI22_dango3) C++17
100 / 100
 527 ms 996 KB 
#include "dango3.h"
#include <bits/stdc++.h>
using namespace std;
/*                                                    __                    __                        __                        */
/*        ======     _      /| /|  __   _            /   |  |   /|  |   @  |    |  |  | /   /| |\  | /   |  |  @ | /            */   
/*          ||  |_| |_     / |/ | |  | |_  |-        |   |--|  /-|  |   |  \ \  |==|  |-   /=| | \ | |   |--|  | |-             */
/*          ||  | | |_    /     | |__|  _| |_        \__ |  | /  |  |__ |  __|  |  |  | \ /  | |  \| \__ |  |  | | \            */ 
/*                                                                                                                              */         


void Solve(int n, int m) {
    queue < pair < vector <int> ,int >  > q;
    vector <int> in;
    vector <vector <int> > ans;
    for(int i=1;i<=n*m;i++){
        in.push_back(i);
    }
    q.push({in,m});
    while(!q.empty()){
        vector <int> v=q.front().first;
        int k=q.front().second;
        q.pop();
        if(k<=1){
            ans.push_back(v);
        }
        else{
            vector <int> used(v.size());
            for(int i=0;i<v.size();i++){
                used[i]=1;
                vector <int> x;
                for(int j=0;j<v.size();j++){
                    if(used[j]==0)x.push_back(v[j]);
                }
                if(Query(x)<k/2)used[i]=0;
            }
            vector <int> g1,g2;
            for(int i=0;i<v.size();i++){
                if(used[i]==0)g1.push_back(v[i]);
                else g2.push_back(v[i]);
            }
            q.push({g1,k/2});
            if(k%2==1)q.push({g2,k/2+1});
            else q.push({g2,k/2});
            
        }
        
    }
    for(auto x : ans){
        Answer(x);
    }
    return;
}

Compilation message

dango3.cpp: In function 'void Solve(int, int)':
dango3.cpp:28:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   28 |             for(int i=0;i<v.size();i++){
      |                         ~^~~~~~~~~
dango3.cpp:31:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   31 |                 for(int j=0;j<v.size();j++){
      |                             ~^~~~~~~~~
dango3.cpp:37:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   37 |             for(int i=0;i<v.size();i++){
      |                         ~^~~~~~~~~

Subtask #1
2.0 / 2.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 344 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct

Subtask #2
5.0 / 5.0

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

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 123 ms 616 KB Output is correct
2 Correct 140 ms 616 KB Output is correct
3 Correct 131 ms 600 KB Output is correct
4 Correct 132 ms 616 KB Output is correct
5 Correct 114 ms 856 KB Output is correct
6 Correct 115 ms 848 KB Output is correct

Subtask #4
78.0 / 78.0

# 결과 실행 시간 메모리 Grader output
1 Correct 441 ms 800 KB Output is correct
2 Correct 449 ms 996 KB Output is correct
3 Correct 527 ms 740 KB Output is correct
4 Correct 519 ms 852 KB Output is correct
5 Correct 441 ms 752 KB Output is correct
6 Correct 423 ms 740 KB Output is correct