oj.uz

Submission #781984

# Submission time Handle Problem Language Result Execution time Memory
781984 2023-07-13T14:28:11 Z hariaakas646 Tropical Garden (IOI11_garden) C++17
49 / 100
 5000 ms 2004 KB 
#include <bits/stdc++.h>
#include <gardenlib.h>

using namespace std;

#define scd(t) scanf("%d", &t)
#define scld(t) scanf("%ld", &t)
#define sclld(t) scanf("%lld", &t)
#define scc(t) scanf("%c", &t)
#define scs(t) scanf("%s", t)
#define scf(t) scanf("%f", &t)
#define sclf(t) scanf("%lf", &t)
#define forr(i, j, k) for (int i = j; i < k; i++)
#define frange(i, j) forr(i, 0, j)
#define all(cont) cont.begin(), cont.end()
#define mp make_pair
#define pb push_back
#define f first
#define s second
typedef long int li;
typedef unsigned long int uli;
typedef long long int lli;
typedef unsigned long long int ulli;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<lli> vll;
typedef vector<string> vs;
typedef vector<pii> vii;
typedef vector<vi> vvi;
typedef map<int, int> mpii;
typedef set<int> seti;
typedef multiset<int> mseti;
typedef long double ld;

void count_routes(int n, int m, int p, int edges[][2], int q, int stud[])
{
    int k = stud[0];
    vector<vii> graph(n);
    frange(i, m)
    {
        int a = edges[i][0];
        int b = edges[i][1];
        int c = m - i;
        graph[a].pb({b, c});
        graph[b].pb({a, c});
    }
    int ans = 0;
    frange(i, n)
    {
        int c = i;
        int pre = -1;
        frange(i, k)
        {
            int mv = 0;
            int mid = -1;
            for (auto p : graph[c])
            {
                if (p.f != pre)
                {
                    if (p.s > mv)
                    {
                        mv = p.s;
                        mid = p.f;
                    }
                }
            }
            if (mid == -1)
            {
                mid = graph[c][0].f;
            }
            pre = c;
            c = mid;
        }
        if (c == p)
            ans++;
    }
    answer(ans);
}

Subtask #1
49.0 / 49.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 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 4 ms 596 KB Output is correct

Subtask #2
0 / 20.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 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 4 ms 596 KB Output is correct
10 Correct 6 ms 304 KB Output is correct
11 Execution timed out 5071 ms 2004 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #3
0 / 31.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 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 4 ms 596 KB Output is correct
10 Correct 6 ms 304 KB Output is correct
11 Execution timed out 5071 ms 2004 KB Time limit exceeded
12 Halted 0 ms 0 KB -