oj.uz

Submission #718781

# Submission time Handle Problem Language Result Execution time Memory
718781 2023-04-04T19:03:23 Z n0sk1ll The Collection Game (BOI21_swaps) C++14
15 / 100
 62 ms 732 KB 
#include <bits/stdc++.h>

#define FAST ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);cerr.tie(0)
#define mp make_pair
#define xx first
#define yy second
#define pb push_back
#define pf push_front
#define popb pop_back
#define popf pop_front
#define all(x) x.begin(),x.end()
#define ff(i,a,b) for (int i = a; i < b; i++)
#define fff(i,a,b) for (int i = a; i <= b; i++)
#define bff(i,a,b) for (int i = b-1; i >= a; i--)
#define bfff(i,a,b) for (int i = b; i >= a; i--)

using namespace std;
long double typedef ld;
unsigned int typedef ui;
long long int typedef li;
pair<int,int> typedef pii;
pair<li,li> typedef pli;
pair<ld,ld> typedef pld;
vector<vector<int>> typedef graph;
unsigned long long int typedef ull;
//const int mod = 998244353;
const int mod = 1000000007;







//Note to self: Check for overflow

#include "swaps.h"

bool komp[503][503]; //less

struct bogosort
{
    bool operator() (int a, int b)
    {
        return komp[a][b];
    }
};

void solve(int n, int allowed_visits)
{
    if (allowed_visits<n)
    {
        answer({0,0,0,0});
        return;
    }

    fff(d,1,n-1)
    {
        vector<bool> tvis(n,0);
        vector<int> koji;
        fff(i,1,n-d) if (!tvis[i]) schedule(i,i+d),tvis[i+d]=1,koji.pb(i);
        vector<int> v=visit();
        ff(i,0,(int)v.size()) if (v[i]) komp[koji[i]][koji[i]+d]=1;
        else komp[koji[i]+d][koji[i]]=1;

        bool ok=false;
        koji.clear();
        fff(i,1,n-d) if (tvis[i]) schedule(i,i+d),ok=true,koji.pb(i);
        if (ok)
        {
            v=visit();
            ff(i,0,(int)v.size()) if (v[i]) komp[koji[i]][koji[i]+d]=1;
            else komp[koji[i]+d][koji[i]]=1;
        }

    }

    vector<int> ans;
    fff(i,1,n) ans.pb(i);
    sort(all(ans),bogosort());
    answer(ans);
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 300 KB Correct
2 Correct 4 ms 336 KB Correct
3 Correct 19 ms 432 KB Correct
4 Correct 48 ms 564 KB Correct
5 Correct 51 ms 560 KB Correct
6 Correct 52 ms 568 KB Correct
7 Correct 62 ms 668 KB Correct
8 Correct 48 ms 564 KB Correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Correct
2 Correct 5 ms 352 KB Correct
3 Correct 17 ms 436 KB Correct
4 Correct 54 ms 572 KB Correct
5 Correct 43 ms 564 KB Correct
6 Correct 46 ms 568 KB Correct
7 Correct 55 ms 732 KB Correct
8 Correct 59 ms 572 KB Correct
9 Correct 46 ms 568 KB Correct
10 Correct 55 ms 564 KB Correct
11 Correct 41 ms 600 KB Correct
12 Correct 50 ms 592 KB Correct
13 Correct 51 ms 568 KB Correct

Subtask #3
0 / 3.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 208 KB Not correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 2.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 208 KB Not correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 220 KB Not correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 6.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 220 KB Not correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 208 KB Not correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 6.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 208 KB Not correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 208 KB Not correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 208 KB Not correct
2 Halted 0 ms 0 KB -

Subtask #11
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 208 KB Not correct
2 Halted 0 ms 0 KB -

Subtask #12
0 / 6.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 208 KB Not correct
2 Halted 0 ms 0 KB -