oj.uz

답안 #677745

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
677745 2023-01-04T09:34:35 Z DwightKSchrute Super Dango Maker (JOI22_dango3) C++17
7 / 100
 1598 ms 492 KB 
/*
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
 */
#include<bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

//using namespace __gnu_pbds;
using namespace std;

typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int>vi;
typedef vector<vector<int>>vvi;
typedef vector<ll>vl;
typedef vector<vl> vvl;
typedef pair<int,int>pi;
typedef pair<ll,ll> pl;
typedef vector<pl> vpl;
typedef vector<ld> vld;
typedef pair<ld,ld> pld;
typedef vector<pi> vpi;

//typedef tree<ll, null_type, less_equal<ll>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
template<typename T> ostream& operator<<(ostream& os, vector<T>& a){os<<"[";for(int i=0; i<ll(a.size()); i++){os << a[i] << ((i!=ll(a.size()-1)?" ":""));}os << "]\n"; return os;}

#define all(x) x.begin(),x.end()
#define YES out("YES")
#define NO out("NO")
#define out(x){cout << x << "\n"; return;}
#define outfl(x){cout << x << endl;return;}
#define GLHF ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define print(x){for(auto ait:x) cout << ait << " "; cout << "\n";}
#define pb push_back
#define umap unordered_map


template<typename T>
void read(vector<T>& v){
    int n=v.size();
    for(int i=0; i<n; i++)
        cin >> v[i];
}
template<typename T>
vector<T>UNQ(vector<T>a){
    vector<T>ans;
    for(T t:a)
        if(ans.empty() || t!=ans.back())
            ans.push_back(t);
    return ans;
}

#include "dango3.h"

void Solve(int n,int m){
    vector<bool>done(n*m+1);

    vvi who(n+1);

    for(int _=0; _<m; _++){
        vi ans;
        vi cur;

        for(int i=1; i<=n*m ;i++)
            if(!done[i])
                cur.pb(i);
        for(int i=1;ans.size()<n && i<=n*m; i++){
            if(done[i])
                continue;
            vi tmp(cur);
            tmp.erase(find(all(tmp),i));
            if(Query(tmp)==m-1-_){
                cur=tmp;
                ans.pb(i);
                done[i]=1;
            }

        }
        Answer(ans);
    }

}
/*
 3 2
3 3 1 2 1 2

 */

Compilation message

dango3.cpp: In function 'void Solve(int, int)':
dango3.cpp:70:31: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   70 |         for(int i=1;ans.size()<n && i<=n*m; i++){
      |                     ~~~~~~~~~~^~

Subtask #1
2.0 / 2.0

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

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 376 KB Output is correct
2 Correct 11 ms 340 KB Output is correct
3 Correct 21 ms 340 KB Output is correct
4 Correct 17 ms 368 KB Output is correct
5 Correct 4 ms 340 KB Output is correct
6 Correct 5 ms 340 KB Output is correct

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 363 ms 412 KB Output is correct
2 Correct 463 ms 340 KB Output is correct
3 Incorrect 1029 ms 428 KB Wrong Answer [3]
4 Halted 0 ms 0 KB -

Subtask #4
0 / 78.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1598 ms 492 KB Wrong Answer [3]
2 Halted 0 ms 0 KB -