답안 #722189

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
722189	2023-04-11T14:12:38 Z	keta_tsimakuridze	Amusement Park (JOI17_amusement_park)	C++14	73 / 100	31 ms	7448 KB

Joi

#include "Joi.h"
#include <bits/stdc++.h>
using namespace std;
#define in in2
#define timer timer2
#define V V2
static const int N2 = 1e4 + 5;
static int in[N2], timer;
vector<int> V[N2];
long long x;
void DFS(int u) {
    in[u] = ++timer; //cout << "+" << u << endl;
    for(int i = 0; i < V[u].size(); i++) {
        if(!in[V[u][i]]) DFS(V[u][i]);
    }
    MessageBoard(u, ((1ll << (in[u] % 60)) & x) ? 1 : 0);
}
void Joi(int N, int M, int A[], int B[], long long X, int T) {
    x = X;
  for(int i = 0; i < M; i++) {
    V[A[i]].push_back(B[i]);
    V[B[i]].push_back(A[i]);
  }
  for(int i = 0; i < N; i++) {
    sort(V[i].begin(), V[i].end());
//    if(!i) for(int j = 0; j < V[i].size(); j++) cout << V[i][j] << " ";
  }
  DFS(0);
}

Ioi

#include "Ioi.h"
#include <bits/stdc++.h>
using namespace std;
static const int N = 1e4 + 5;
#define ll long long
ll p[N], in[N], timer, f[60], C, Val, cur;
vector<int> V[N], adj[N];
map<int,int> F[N];
void dfs(int u) {
    in[u] = ++timer;
    for(int i = 0; i < V[u].size(); i++) {
        if(!in[V[u][i]]) dfs(V[u][i]), adj[u].push_back(V[u][i]), p[V[u][i]] = u;
    }
}
ll ans = 0;
long long move_(int u, int x) {
    assert(cur == u && F[u][x]);
//    cout << u << "-->" << x << endl;
    cur = x;
    return Move(x);
}
void dfs2(int u) {
    if(!f[in[u] % 60]) --C;
    f[in[u] % 60] = 1; if(Val) ans |= (ll)(1ll << (in[u] % 60));
    if(!C) return;
    for(int i = 0; i < adj[u].size(); i++) {
        if(!C) return;
        if(!f[in[adj[u][i]] % 60]) Val = move_(u, adj[u][i]), dfs2(adj[u][i]);
    }
    if(!C) return;
    Val = move_(u, p[u]);
}
long long Ioi(int N, int M, int A[], int B[], int v, int P, int t) {
  for(int i = 0; i  < M; i++) {
    V[A[i]].push_back(B[i]);
    V[B[i]].push_back(A[i]);
    F[A[i]][B[i]] = F[B[i]][A[i]] = 1;
  }
  for(int i = 0; i < N; i++) {
    sort(V[i].begin(), V[i].end());
  }
  C = 60;
  dfs(0);
  Val = P; cur = v;
  while(C) {
    dfs2(v);
    if(C) v = p[v];
  }
  return ans;
}

Compilation message

Joi.cpp: In function 'void DFS(int)':
Joi.cpp:13:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   13 |     for(int i = 0; i < V[u].size(); i++) {
      |                    ~~^~~~~~~~~~~~~

Ioi.cpp: In function 'void dfs(int)':
Ioi.cpp:11:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   11 |     for(int i = 0; i < V[u].size(); i++) {
      |                    ~~^~~~~~~~~~~~~
Ioi.cpp: In function 'void dfs2(int)':
Ioi.cpp:26:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 |     for(int i = 0; i < adj[u].size(); i++) {
      |                    ~~^~~~~~~~~~~~~~~

Subtask #1

8.0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	1800 KB	Output is correct
2	Correct	2 ms	1796 KB	Output is correct
3	Correct	2 ms	1796 KB	Output is correct
4	Correct	2 ms	1792 KB	Output is correct
5	Correct	2 ms	1792 KB	Output is correct
6	Correct	2 ms	1808 KB	Output is correct
7	Correct	2 ms	1804 KB	Output is correct
8	Correct	2 ms	1796 KB	Output is correct
9	Correct	2 ms	1800 KB	Output is correct
10	Correct	2 ms	1792 KB	Output is correct
11	Correct	7 ms	2628 KB	Output is correct
12	Correct	2 ms	1800 KB	Output is correct
13	Correct	2 ms	1808 KB	Output is correct
14	Correct	2 ms	1804 KB	Output is correct
15	Correct	2 ms	1796 KB	Output is correct
16	Correct	2 ms	1796 KB	Output is correct
17	Correct	2 ms	1804 KB	Output is correct
18	Correct	2 ms	1804 KB	Output is correct

Subtask #2

0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	31 ms	7076 KB	Output is correct
2	Correct	31 ms	7092 KB	Output is correct
3	Correct	28 ms	7296 KB	Output is correct
4	Correct	15 ms	4560 KB	Output is correct
5	Correct	17 ms	5240 KB	Output is correct
6	Correct	16 ms	5064 KB	Output is correct
7	Correct	17 ms	4944 KB	Output is correct
8	Correct	20 ms	4992 KB	Output is correct
9	Correct	16 ms	5100 KB	Output is correct
10	Correct	17 ms	4404 KB	Output is correct
11	Correct	20 ms	4412 KB	Output is correct
12	Correct	15 ms	4372 KB	Output is correct
13	Correct	15 ms	4164 KB	Output is correct
14	Correct	20 ms	4504 KB	Output is correct
15	Correct	17 ms	4548 KB	Output is correct
16	Correct	17 ms	4792 KB	Output is correct
17	Correct	16 ms	4768 KB	Output is correct
18	Correct	17 ms	4736 KB	Output is correct
19	Correct	16 ms	4724 KB	Output is correct
20	Correct	13 ms	5064 KB	Output is correct
21	Correct	13 ms	5072 KB	Output is correct
22	Correct	17 ms	4804 KB	Output is correct
23	Correct	19 ms	5128 KB	Output is correct
24	Correct	17 ms	4808 KB	Output is correct
25	Correct	15 ms	5052 KB	Output is correct
26	Correct	17 ms	5284 KB	Output is correct
27	Correct	16 ms	5288 KB	Output is correct
28	Correct	17 ms	5060 KB	Output is correct
29	Correct	16 ms	4864 KB	Output is correct
30	Correct	17 ms	5016 KB	Output is correct
31	Correct	2 ms	1800 KB	Output is correct
32	Correct	2 ms	1800 KB	Output is correct
33	Correct	2 ms	1808 KB	Output is correct
34	Correct	2 ms	1800 KB	Output is correct
35	Runtime error	3 ms	2956 KB	Execution killed with signal 6
36	Halted	0 ms	0 KB	-

Subtask #3

10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	1820 KB	Output is correct
2	Correct	2 ms	1804 KB	Output is correct
3	Correct	2 ms	1792 KB	Output is correct
4	Correct	3 ms	2492 KB	Output is correct
5	Correct	5 ms	2464 KB	Output is correct
6	Correct	4 ms	2404 KB	Output is correct
7	Correct	4 ms	2484 KB	Output is correct
8	Correct	3 ms	2480 KB	Output is correct
9	Correct	13 ms	6148 KB	Output is correct
10	Correct	12 ms	6064 KB	Output is correct
11	Correct	13 ms	6184 KB	Output is correct
12	Correct	2 ms	1876 KB	Output is correct
13	Correct	2 ms	1796 KB	Output is correct
14	Correct	2 ms	1804 KB	Output is correct
15	Correct	2 ms	1792 KB	Output is correct

Subtask #4

55.0 / 55.0

#	결과	실행 시간	메모리	Grader output
1	Correct	29 ms	6952 KB	Output is correct
2	Correct	28 ms	7424 KB	Output is correct
3	Correct	30 ms	7432 KB	Output is correct
4	Correct	17 ms	4600 KB	Output is correct
5	Correct	16 ms	5808 KB	Output is correct
6	Correct	16 ms	5292 KB	Output is correct
7	Correct	16 ms	5264 KB	Output is correct
8	Correct	17 ms	5028 KB	Output is correct
9	Correct	20 ms	5036 KB	Output is correct
10	Correct	17 ms	4656 KB	Output is correct
11	Correct	17 ms	4652 KB	Output is correct
12	Correct	14 ms	4440 KB	Output is correct
13	Correct	16 ms	4372 KB	Output is correct
14	Correct	15 ms	4504 KB	Output is correct
15	Correct	17 ms	4772 KB	Output is correct
16	Correct	16 ms	4780 KB	Output is correct
17	Correct	16 ms	4724 KB	Output is correct
18	Correct	17 ms	4808 KB	Output is correct
19	Correct	16 ms	4692 KB	Output is correct
20	Correct	14 ms	5280 KB	Output is correct
21	Correct	13 ms	5272 KB	Output is correct
22	Correct	16 ms	5296 KB	Output is correct
23	Correct	18 ms	5028 KB	Output is correct
24	Correct	16 ms	4948 KB	Output is correct
25	Correct	16 ms	5236 KB	Output is correct
26	Correct	20 ms	5284 KB	Output is correct
27	Correct	20 ms	5296 KB	Output is correct
28	Correct	16 ms	5008 KB	Output is correct
29	Correct	15 ms	4880 KB	Output is correct
30	Correct	16 ms	5024 KB	Output is correct

Subtask #5

0 / 17.0

#	결과	실행 시간	메모리	Grader output
1	Correct	28 ms	7040 KB	Output is correct
2	Correct	30 ms	7372 KB	Output is correct
3	Correct	30 ms	7448 KB	Output is correct
4	Correct	16 ms	4772 KB	Output is correct
5	Correct	16 ms	5924 KB	Output is correct
6	Correct	16 ms	5028 KB	Output is correct
7	Correct	16 ms	4992 KB	Output is correct
8	Correct	22 ms	5324 KB	Output is correct
9	Correct	16 ms	5164 KB	Output is correct
10	Correct	17 ms	4656 KB	Output is correct
11	Correct	17 ms	4488 KB	Output is correct
12	Correct	15 ms	4292 KB	Output is correct
13	Correct	14 ms	4292 KB	Output is correct
14	Correct	15 ms	4420 KB	Output is correct
15	Correct	17 ms	4556 KB	Output is correct
16	Correct	17 ms	4632 KB	Output is correct
17	Correct	16 ms	4548 KB	Output is correct
18	Correct	16 ms	4612 KB	Output is correct
19	Correct	16 ms	4492 KB	Output is correct
20	Correct	13 ms	5068 KB	Output is correct
21	Correct	13 ms	5060 KB	Output is correct
22	Correct	17 ms	4940 KB	Output is correct
23	Correct	16 ms	4928 KB	Output is correct
24	Correct	17 ms	4956 KB	Output is correct
25	Correct	16 ms	4944 KB	Output is correct
26	Correct	17 ms	4800 KB	Output is correct
27	Correct	18 ms	5112 KB	Output is correct
28	Correct	17 ms	5068 KB	Output is correct
29	Correct	14 ms	4928 KB	Output is correct
30	Correct	16 ms	4932 KB	Output is correct
31	Correct	2 ms	1800 KB	Output is correct
32	Correct	2 ms	1788 KB	Output is correct
33	Correct	2 ms	1796 KB	Output is correct
34	Correct	2 ms	1792 KB	Output is correct
35	Correct	2 ms	1800 KB	Output is correct
36	Correct	2 ms	1800 KB	Output is correct
37	Correct	2 ms	1800 KB	Output is correct
38	Correct	2 ms	1792 KB	Output is correct
39	Correct	2 ms	1792 KB	Output is correct
40	Runtime error	4 ms	2948 KB	Execution killed with signal 6
41	Halted	0 ms	0 KB	-