oj.uz

Submission #568755

# Submission time Handle Problem Language Result Execution time Memory
568755 2022-05-26T07:16:44 Z maomao90 Super Dango Maker (JOI22_dango3) C++17
7 / 100
 2583 ms 728 KB 
// Hallelujah, praise the one who set me free
// Hallelujah, death has lost its grip on me
// You have broken every chain, There's salvation in your name
// Jesus Christ, my living hope
#include <bits/stdc++.h> 
#include "dango3.h"
using namespace std;

template <class T>
inline bool mnto(T& a, T b) {return a > b ? a = b, 1 : 0;}
template <class T>
inline bool mxto(T& a, T b) {return a < b ? a = b, 1: 0;}
#define REP(i, s, e) for (int i = s; i < e; i++)
#define RREP(i, s, e) for (int i = s; i >= e; i--)
typedef long long ll;
typedef long double ld;
#define FI first
#define SE second
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
typedef tuple<int, int, int> iii;
#define ALL(_a) _a.begin(), _a.end()
#define SZ(_a) (int) _a.size()
#define pb push_back
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;
typedef vector<iii> viii;

#ifndef DEBUG
#define cerr if (0) cerr
#endif

const int INF = 1000000005;
const ll LINF = 1000000000000000005ll;
const int MAXN = 400;
const int MAXM = 25;

namespace {
    int n, m;
}

void Solve(int N, int M) {
    n = N; m = M;
    vi id(n * m, 0);
    iota(ALL(id), 1);
    RREP (i, m - 1, 0) {
        vi pref, suf;
        reverse(ALL(id));
        for (int j : id) {
            suf.pb(j);
        }
        reverse(ALL(id));
        vi ans;
        for (int j : id) {
            suf.pop_back();
            vi vec;
            for (int k : pref) {
                vec.pb(k);
            }
            for (int k : suf) {
                vec.pb(k);
            }
            if (Query(vec) == i) {
                ans.pb(j);
                if (SZ(ans) == n) {
                    break;
                }
            } else {
                pref.pb(j);
            }
        }
        vi nid;
        for (int k : pref) {
            nid.pb(k);
        }
        for (int k : suf) {
            nid.pb(k);
        }
        id = nid;
        Answer(ans);
    }
}

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 376 KB Output is correct
2 Correct 16 ms 376 KB Output is correct
3 Correct 32 ms 340 KB Output is correct
4 Correct 33 ms 340 KB Output is correct
5 Correct 7 ms 340 KB Output is correct
6 Correct 6 ms 384 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 651 ms 512 KB Output is correct
2 Correct 811 ms 508 KB Output is correct
3 Incorrect 1548 ms 644 KB Wrong Answer [3]
4 Halted 0 ms 0 KB -

Subtask #4
0 / 78.0

# Verdict Execution time Memory Grader output
1 Incorrect 2583 ms 728 KB Wrong Answer [3]
2 Halted 0 ms 0 KB -