— Dark mode

Datatähti 2024 loppu

Peli

  • Start: 2024-01-20 13:00:00
  • End: 2024-01-20 17:00:00
CSES - Datatähti 2024 loppu - Results
Submission details
Task:Peli
Sender:Kemm1706
Submission time:2024-01-20 16:31:18 +0200
Language:C++ (C++11)
Status:READY
Result:42
Feedback
groupverdictscore
#1ACCEPTED42
#20
Test results
testverdicttimegroup
#1ACCEPTED0.00 s1, 2details
#2ACCEPTED0.00 s1, 2details
#3ACCEPTED0.98 s2details
#4ACCEPTED0.00 s1, 2details
#5ACCEPTED0.00 s1, 2details
#6--2details
#7--2details
#8ACCEPTED0.00 s1, 2details
#9--2details
#10--2details

Compiler report

input/code.cpp: In function 'void bfs(const vvl&, ll, std::vector<std::vector<std::vector<long long int> > >&, vl&, ll, ll, ll, std::queue<long long int>&)':
input/code.cpp:21:17: warning: unused variable 'j' [-Wunused-variable]
   21 |     ll i, node, j;
      |                 ^

Code

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector <ll> vl;
typedef vector <vl> vvl;
typedef pair <ll, ll> pl;
typedef vector <pl> vpl;
typedef vector <bool> vb;

const ll inf = 1e18;
const ll mod = 1e9 + 7;
const ll nmax = 1e6;

#define fi first
#define se second
#define mp make_pair
#define pb push_back

void bfs(const vvl &g, ll n, vector <vvl> &m, vl &parent, ll a, ll b, ll c, queue <ll> &q)
{
    ll i, node, j;

    q.push(a);

    while(!q.empty())
    {
        node = q.front();
        q.pop();
        for(auto x : g[node])
        {
            if(x != parent[node])
            {
                parent[x] = node;
                ll t = node;
                while(x != 0)
                {
                    bool change = false;
                    for(i = 1; i <= n; i++)
                    {
                        if(m[0][node][i] != inf && m[1][x][i] > m[0][node][i] + 1)
                        {
                            m[1][x][i] = m[1][i][x] = m[0][node][i] + 1;
                            change = true;
                        }
                        if(m[1][node][i] != inf && m[0][x][i] > m[1][node][i] + 1)
                        {
                            m[0][x][i] = m[0][i][x] = m[1][node][i] + 1;
                            change = true;
                        }
                    }
                    if(change)
                        q.push(x);
                    else
                        break;
                    node = x;
                    x = parent[x];
                }
                node = t;
                if(m[c % 2][a][b] != inf)
                    return;
            }
        }
    }

    /*for(ll i = 1; i <= n; i++)
    {
        cerr << i << ": ";
        for(ll j = 1; j <= n; j++)
            cerr << m[0][i][j] << " ";
        cerr << "\n";
    }
    cerr << "\n";
    for(ll i = 1; i <= n; i++)
    {
        cerr << i << ": ";
        for(ll j = 1; j <= n; j++)
            cerr << m[1][i][j] << " ";
        cerr << "\n";
    }*/

}

/*4 5 6
1 2
2 3
1 3
2 4
3 4
1 2 2
1 4 1
1 4 5
2 2 1
2 2 2
3 4 8*/

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);

    ll n, t, q, i, a, b, k;
    pl ans;
    cin >> n >> t >> q;
    vvl g(n + 1);
    vpl minn(n + 1, {inf, inf});
    vl parent(n + 1, 0);
    queue <ll> x;
    vector <vvl> m(2, vvl(n + 1, vl(n + 1, inf)));
    for(i = 1; i <= n; i++)
        m[0][i][i] = 0;

    for(i = 0; i < t; i++)
    {
        cin >> a >> b;
        g[a].pb(b);
        g[b].pb(a);
    }

    //bfs(g, n, m, parent);

    //cerr << "\n";

    while(q--)
    {
        cin >> a >> b >> k;
        bfs(g, n, m, parent, a, b, k, x);

        //cerr << m[k % 2][a][b] << "\n";

        if(m[k % 2][a][b] <= k)
            cout << "YES\n";
        else
            cout << "NO\n";
    }

    /*for(ll i = 1; i <= n; i++)
    {
        cerr << i << ": ";
        for(ll j = 1; j <= n; j++)
            cerr << m[0][i][j] << " ";
        cerr << "\n";
    }
    cerr << "\n";
    for(ll i = 1; i <= n; i++)
    {
        cerr << i << ": ";
        for(ll j = 1; j <= n; j++)
            cerr << m[1][i][j] << " ";
        cerr << "\n";
    }*/

    return 0;
}

Test details

Test 1

Group: 1, 2

Verdict: ACCEPTED

input
2 1 100
1 2
1 1 0
1 2 0
2 1 0
...
view save

correct output
YES
NO
NO
YES
NO
...
view save

user output
YES
NO
NO
YES
NO
...
Truncated

Test 2

Group: 1, 2

Verdict: ACCEPTED

input
50 49 100
33 34
7 8
49 50
47 48
...
view save

correct output
NO
NO
NO
NO
NO
...
view save

user output
NO
NO
NO
NO
NO
...
Truncated

Test 3

Group: 2

Verdict: ACCEPTED

input
2500 2499 100000
821 822
2351 2352
752 753
832 833
...
view save

correct output
NO
YES
YES
NO
NO
...
view save

user output
NO
YES
YES
NO
NO
...
Truncated

Test 4

Group: 1, 2

Verdict: ACCEPTED

input
12 12 100
9 10
2 3
1 12
1 2
...
view save

correct output
NO
NO
NO
NO
NO
...
view save

user output
NO
NO
NO
NO
NO
...
Truncated

Test 5

Group: 1, 2

Verdict: ACCEPTED

input
11 11 100
10 11
7 8
1 2
5 6
...
view save

correct output
YES
YES
YES
YES
YES
...
view save

user output
YES
YES
YES
YES
YES
...
Truncated

Test 6

Group: 2

Verdict:

input
2500 2500 100000
1936 1937
1884 1885
751 752
831 832
...
view save

correct output
NO
YES
YES
NO
NO
...
view save

user output
(empty)

Test 7

Group: 2

Verdict:

input
2499 2499 100000
821 822
2351 2352
752 753
832 833
...
view save

correct output
YES
YES
YES
YES
YES
...
view save

user output
(empty)

Test 8

Group: 1, 2

Verdict: ACCEPTED

input
50 99 100
40 47
34 50
44 47
15 16
...
view save

correct output
YES
YES
YES
YES
YES
...
view save

user output
YES
YES
YES
YES
YES
...
Truncated

Test 9

Group: 2

Verdict:

input
2500 4999 100000
1191 2361
251 399
1026 2300
82 1655
...
view save

correct output
YES
YES
YES
YES
YES
...
view save

user output
(empty)

Test 10

Group: 2

Verdict:

input
2500 4999 100000
2023 2218
23 51
1020 1272
11 114
...
view save

correct output
YES
YES
YES
YES
YES
...
view save

user output
(empty)

Tasks

A Palindromi-B Sukat-C Sulut-D Peli-E Retkeily-F Polut-

Submissions (Kemm1706)

2024-01-20 16:50:02 422024-01-20 16:45:52 422024-01-20 16:44:47 422024-01-20 16:32:19 02024-01-20 16:31:18 422024-01-20 16:30:00 422024-01-20 16:28:03 422024-01-20 16:17:45 422024-01-20 16:13:58 422024-01-20 16:07:35 02024-01-20 16:04:47 02024-01-20 14:50:57 42