oj.uz

Submission #1034077

# Submission time Handle Problem Language Result Execution time Memory
1034077 2024-07-25T09:33:59 Z Antekb Island Hopping (JOI24_island) C++17
65 / 100
 8 ms 1368 KB 
#include "bits/stdc++.h"	/** keep-include */
using namespace std;

#define rep(i, b, e) for(int i = (b); i <= (e); i++)
#define per(i, b, e) for(int i = (e); i >= (b); i--)
#define FOR(i, b, e) rep(i, b, (e) - 1)
#define SZ(x) int(x.size())
#define all(x) x.begin(), x.end()
#define pb push_back
#define mp make_pair
#define st first
#define nd second
using ll = long long;
using vi = vector<int>;
using pii = pair<int, int>;

auto &operator<<(auto &o, pair<auto, auto> p) {
	return o << "(" << p.st << ", " << p.nd << ")"; }
auto operator<<(auto &o, auto x)->decltype(end(x), o) {
	o << "{"; int i=0; for(auto e: x) o << ", " + 2*!i++ << e;
	return o << "}"; }
#ifdef LOCAL
#define deb(x...) cerr << "[" #x "]: ", [](auto...$) { \
	((cerr << $ << "; "),...) << endl; }(x)
#else
#define deb(...)
#endif
#include "island.h"

const int N=305;
int r[N];
int find(int v){
    if(r[v]==v)return v;
    return find(r[v]);
}
void Union(int a, int b){
    a=find(a);
    b=find(b);
    r[a]=b;
}

map<pair<int, int>, int > M;
int query2(int v, int d){
    if(M.find(mp(v, d))!=M.end()){
        return M[mp(v, d)];
    }
    int ans=query(v, d);
    M[mp(v, d)]=ans;
    return ans;
}

void solve(int n, int L) {
    vector<vector<int> > edg(n+1);
    for(int i=1; i<=n; i++){
        r[i]=i;
    }
    vector<int> first_wrong(n+1);
    vector<int> cand(n+1);
    for(int v=1; v<n; v++){
        while(edg[v].size()<n-1){
            int u = query2(v, edg[v].size()+1);
            first_wrong[v]=u;
            if(find(u)==find(v))break;
            if(edg[v].size() && u<edg[v].back())break;
            bool is_first_wrong=0;
            bool different_parity=0;
            for(int w:edg[v]){
                if(first_wrong[w]==u)is_first_wrong=1;
            }
            for(int w:edg[v]){
                for(int ww:edg[w]){
                    if(ww !=v && first_wrong[ww]==u)different_parity=1;
                }
            }
            if(v<cand[u])break;
            if(different_parity)break;
            if(edg[v].size() && !is_first_wrong){
                int w=query2(u, edg[u].size()+1);
                cand[u]=w;
                if(w!=v)break;
            }
            edg[u].pb(v);
            edg[v].pb(u);
            Union(u, v);
            answer(u, v);
            first_wrong[v]=0;
        }
    }
    /*int variable_example = query(1, 1);
    for (int i = 2; i <= n; i++) {
        answer(1, i);
    }*/
}

Compilation message

island.cpp:17:18: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
   17 | auto &operator<<(auto &o, pair<auto, auto> p) {
      |                  ^~~~
island.cpp:17:32: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
   17 | auto &operator<<(auto &o, pair<auto, auto> p) {
      |                                ^~~~
island.cpp:17:38: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
   17 | auto &operator<<(auto &o, pair<auto, auto> p) {
      |                                      ^~~~
island.cpp:19:17: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
   19 | auto operator<<(auto &o, auto x)->decltype(end(x), o) {
      |                 ^~~~
island.cpp:19:26: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
   19 | auto operator<<(auto &o, auto x)->decltype(end(x), o) {
      |                          ^~~~
island.cpp: In function 'void solve(int, int)':
island.cpp:60:28: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   60 |         while(edg[v].size()<n-1){
      |               ~~~~~~~~~~~~~^~~~

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct

Subtask #2
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 7 ms 488 KB Output is correct
6 Correct 6 ms 344 KB Output is correct
7 Correct 6 ms 344 KB Output is correct
8 Correct 6 ms 632 KB Output is correct
9 Correct 5 ms 500 KB Output is correct

Subtask #3
0 / 7.0

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

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 6 ms 448 KB Output is correct
3 Correct 5 ms 344 KB Output is correct
4 Correct 5 ms 600 KB Output is correct
5 Correct 5 ms 344 KB Output is correct
6 Correct 5 ms 488 KB Output is correct
7 Correct 5 ms 344 KB Output is correct
8 Correct 5 ms 488 KB Output is correct
9 Correct 7 ms 344 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 344 KB Output is correct
2 Correct 5 ms 344 KB Output is correct
3 Correct 5 ms 344 KB Output is correct
4 Correct 4 ms 344 KB Output is correct
5 Correct 7 ms 600 KB Output is correct
6 Correct 5 ms 344 KB Output is correct
7 Correct 6 ms 492 KB Output is correct
8 Correct 7 ms 344 KB Output is correct
9 Correct 5 ms 492 KB Output is correct

Subtask #6
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 7 ms 488 KB Output is correct
6 Correct 6 ms 344 KB Output is correct
7 Correct 6 ms 344 KB Output is correct
8 Correct 6 ms 632 KB Output is correct
9 Correct 5 ms 500 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 6 ms 448 KB Output is correct
12 Correct 5 ms 344 KB Output is correct
13 Correct 5 ms 600 KB Output is correct
14 Correct 5 ms 344 KB Output is correct
15 Correct 5 ms 488 KB Output is correct
16 Correct 5 ms 344 KB Output is correct
17 Correct 5 ms 488 KB Output is correct
18 Correct 7 ms 344 KB Output is correct
19 Correct 5 ms 344 KB Output is correct
20 Correct 5 ms 344 KB Output is correct
21 Correct 5 ms 344 KB Output is correct
22 Correct 4 ms 344 KB Output is correct
23 Correct 5 ms 344 KB Output is correct
24 Correct 5 ms 600 KB Output is correct
25 Correct 7 ms 468 KB Output is correct
26 Correct 5 ms 344 KB Output is correct
27 Correct 5 ms 452 KB Output is correct
28 Correct 7 ms 344 KB Output is correct
29 Correct 6 ms 344 KB Output is correct
30 Correct 5 ms 452 KB Output is correct
31 Correct 4 ms 344 KB Output is correct
32 Correct 5 ms 344 KB Output is correct
33 Correct 5 ms 600 KB Output is correct
34 Correct 7 ms 1236 KB Output is correct
35 Correct 6 ms 348 KB Output is correct
36 Correct 5 ms 600 KB Output is correct
37 Correct 5 ms 636 KB Output is correct
38 Correct 6 ms 344 KB Output is correct
39 Correct 5 ms 344 KB Output is correct
40 Correct 5 ms 460 KB Output is correct
41 Correct 7 ms 444 KB Output is correct
42 Correct 5 ms 344 KB Output is correct
43 Correct 8 ms 600 KB Output is correct
44 Correct 5 ms 344 KB Output is correct

Subtask #7
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 7 ms 344 KB Output is correct
5 Correct 5 ms 344 KB Output is correct
6 Correct 5 ms 344 KB Output is correct
7 Correct 4 ms 344 KB Output is correct
8 Correct 7 ms 600 KB Output is correct
9 Correct 5 ms 344 KB Output is correct
10 Correct 6 ms 492 KB Output is correct
11 Correct 7 ms 344 KB Output is correct
12 Correct 5 ms 492 KB Output is correct
13 Correct 6 ms 1368 KB Output is correct
14 Correct 5 ms 344 KB Output is correct
15 Correct 5 ms 472 KB Output is correct
16 Correct 7 ms 344 KB Output is correct
17 Correct 4 ms 344 KB Output is correct
18 Correct 5 ms 484 KB Output is correct
19 Correct 6 ms 600 KB Output is correct
20 Correct 5 ms 344 KB Output is correct
21 Correct 5 ms 344 KB Output is correct
22 Correct 5 ms 636 KB Output is correct
23 Correct 6 ms 344 KB Output is correct
24 Correct 4 ms 596 KB Output is correct
25 Correct 7 ms 1112 KB Output is correct
26 Correct 6 ms 488 KB Output is correct
27 Correct 5 ms 600 KB Output is correct
28 Correct 5 ms 600 KB Output is correct
29 Correct 5 ms 504 KB Output is correct
30 Correct 5 ms 344 KB Output is correct
31 Correct 5 ms 344 KB Output is correct
32 Correct 5 ms 460 KB Output is correct
33 Correct 8 ms 344 KB Output is correct
34 Correct 6 ms 492 KB Output is correct
35 Correct 5 ms 344 KB Output is correct
36 Correct 6 ms 600 KB Output is correct
37 Correct 8 ms 344 KB Output is correct
38 Correct 5 ms 468 KB Output is correct

Subtask #8
0 / 28.0

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