oj.uz

Submission #20385

# Submission time Handle Problem Language Result Execution time Memory
20385 2017-02-10T16:24:09 Z admin Can polan into space? (OJUZ11_space) C++14
100 / 100
 149 ms 13648 KB 
/* CURRENTLY WRONG */
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <memory.h>
#include <math.h>
#include <assert.h>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <algorithm>
#include <string>
#include <functional>
#include <vector>
#include <deque>
#include <utility>
#include <bitset>
#include <limits.h>
#include <time.h>
#include <functional>
#include <numeric>
 
using namespace std;
typedef long long ll;
typedef unsigned long long llu;
typedef double lf;
typedef unsigned int uint;
typedef long double llf;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
 
#define debug(format, ...) printf(format, __VA_ARGS__);
 
const int N_ = 200500;
 
int N;
long long V[N_][3];
 
long long tb[N_][3], mx[3];
int tbp[N_][3], mxp[3];
 
long long sum1;
 
int timing[N_];
 
int main() {
  scanf("%d", &N);
  for(int i = 1; i <= N; i++) {
    for(int k = 0; k < 3; k++) {
      scanf("%lld", &V[i][k]);
    }
    sum1 += V[i][1];
    V[i][0] -= V[i][1];
    V[i][2] -= V[i][1];
    V[i][1] = 0;
  }
 
  tb[1][0] = V[1][0];
  tie(mx[0], mxp[0]) = make_pair(tb[1][0], 1);
 
  tb[1][2] = -(ll)1e18;
  tie(mx[2], mxp[2]) = make_pair(tb[1][2], 1);
 
  for(int i = 2; i < N; i++) {
    tie(tb[i][0], tbp[i][0]) = max(make_pair(mx[2] + V[i][0], mxp[2]), make_pair(V[i][0], 0));
    tie(tb[i][2], tbp[i][2]) = make_pair(mx[0] + V[i][2], mxp[0]);
    for(int k = 0; k < 3; k++) {
      if(mx[k] < tb[i][k])
        tie(mx[k], mxp[k]) = make_pair(tb[i][k], i);
    }
  }
 
  ll cases[] = {
    mx[2] + V[N][0],
    mx[0] + V[N][1],
    V[N][0]
  };
 
  ll best = *max_element(cases, cases+3);
  printf("%lld\n", best + sum1);
 
  fill(timing + 1, timing + N + 1, 1);
 
  if(best == cases[0]) {
    timing[N] = 0;
    for(int i = mxp[2], s = 2; i > 0; i = tbp[i][s], s = 2 - s) {
      timing[i] = s;
    }
  }else if(best == cases[1]) {
    for(int i = mxp[0], s = 0; i > 0; i = tbp[i][s], s = 2 - s) {
      timing[i] = s;
    }
  }else if(best == cases[2]) {
    timing[N] = 0;
  }else {
    assert(0);
  }
 
  for(int i = 1; i <= N; i++) {
    if(timing[i] == 0) printf("%d ", i);
  }
  for(int i = 1; i <= N; i++) {
    if(timing[i] == 0) {
      for(int j = i-1; j > 0 && timing[j] == 1; j--) printf("%d ", j);
      for(int j = i+1; j <= N && timing[j] == 1; j++) printf("%d ", j);
    }
  }
  for(int i = 1; i <= N; i++) {
    if(timing[i] == 2) printf("%d ", i);
  }
 
 
	return 0;
}

Compilation message

space.cpp: In function 'int main()':
space.cpp:48:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &N);
                  ^
space.cpp:51:30: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
       scanf("%lld", &V[i][k]);
                              ^

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 13648 KB Output is correct
2 Correct 0 ms 13648 KB Output is correct
3 Correct 0 ms 13648 KB Output is correct
4 Correct 0 ms 13648 KB Output is correct
5 Correct 0 ms 13648 KB Output is correct
6 Correct 0 ms 13648 KB Output is correct
7 Correct 0 ms 13648 KB Output is correct
8 Correct 0 ms 13648 KB Output is correct
9 Correct 0 ms 13648 KB Output is correct
10 Correct 0 ms 13648 KB Output is correct
11 Correct 0 ms 13648 KB Output is correct
12 Correct 0 ms 13648 KB Output is correct
13 Correct 0 ms 13648 KB Output is correct
14 Correct 0 ms 13648 KB Output is correct
15 Correct 0 ms 13648 KB Output is correct
16 Correct 0 ms 13648 KB Output is correct
17 Correct 0 ms 13648 KB Output is correct
18 Correct 0 ms 13648 KB Output is correct
19 Correct 0 ms 13648 KB Output is correct
20 Correct 0 ms 13648 KB Output is correct
21 Correct 0 ms 13648 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 13648 KB Output is correct
2 Correct 0 ms 13648 KB Output is correct
3 Correct 0 ms 13648 KB Output is correct
4 Correct 0 ms 13648 KB Output is correct
5 Correct 0 ms 13648 KB Output is correct
6 Correct 0 ms 13648 KB Output is correct
7 Correct 0 ms 13648 KB Output is correct
8 Correct 0 ms 13648 KB Output is correct
9 Correct 0 ms 13648 KB Output is correct
10 Correct 0 ms 13648 KB Output is correct
11 Correct 0 ms 13648 KB Output is correct
12 Correct 0 ms 13648 KB Output is correct
13 Correct 0 ms 13648 KB Output is correct
14 Correct 0 ms 13648 KB Output is correct
15 Correct 0 ms 13648 KB Output is correct
16 Correct 0 ms 13648 KB Output is correct
17 Correct 0 ms 13648 KB Output is correct
18 Correct 0 ms 13648 KB Output is correct
19 Correct 0 ms 13648 KB Output is correct
20 Correct 0 ms 13648 KB Output is correct
21 Correct 0 ms 13648 KB Output is correct
22 Correct 0 ms 13648 KB Output is correct
23 Correct 0 ms 13648 KB Output is correct
24 Correct 0 ms 13648 KB Output is correct
25 Correct 0 ms 13648 KB Output is correct
26 Correct 0 ms 13648 KB Output is correct
27 Correct 0 ms 13648 KB Output is correct
28 Correct 0 ms 13648 KB Output is correct
29 Correct 0 ms 13648 KB Output is correct
30 Correct 0 ms 13648 KB Output is correct
31 Correct 0 ms 13648 KB Output is correct
32 Correct 0 ms 13648 KB Output is correct
33 Correct 0 ms 13648 KB Output is correct
34 Correct 0 ms 13648 KB Output is correct
35 Correct 0 ms 13648 KB Output is correct
36 Correct 0 ms 13648 KB Output is correct
37 Correct 0 ms 13648 KB Output is correct

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 13648 KB Output is correct
2 Correct 0 ms 13648 KB Output is correct
3 Correct 0 ms 13648 KB Output is correct
4 Correct 0 ms 13648 KB Output is correct
5 Correct 0 ms 13648 KB Output is correct
6 Correct 0 ms 13648 KB Output is correct
7 Correct 0 ms 13648 KB Output is correct
8 Correct 0 ms 13648 KB Output is correct
9 Correct 0 ms 13648 KB Output is correct
10 Correct 0 ms 13648 KB Output is correct
11 Correct 0 ms 13648 KB Output is correct
12 Correct 0 ms 13648 KB Output is correct
13 Correct 0 ms 13648 KB Output is correct
14 Correct 0 ms 13648 KB Output is correct
15 Correct 0 ms 13648 KB Output is correct
16 Correct 0 ms 13648 KB Output is correct
17 Correct 0 ms 13648 KB Output is correct
18 Correct 0 ms 13648 KB Output is correct
19 Correct 0 ms 13648 KB Output is correct
20 Correct 0 ms 13648 KB Output is correct
21 Correct 0 ms 13648 KB Output is correct
22 Correct 0 ms 13648 KB Output is correct
23 Correct 0 ms 13648 KB Output is correct
24 Correct 0 ms 13648 KB Output is correct
25 Correct 0 ms 13648 KB Output is correct
26 Correct 0 ms 13648 KB Output is correct
27 Correct 0 ms 13648 KB Output is correct
28 Correct 0 ms 13648 KB Output is correct
29 Correct 0 ms 13648 KB Output is correct
30 Correct 0 ms 13648 KB Output is correct
31 Correct 0 ms 13648 KB Output is correct
32 Correct 0 ms 13648 KB Output is correct
33 Correct 0 ms 13648 KB Output is correct
34 Correct 0 ms 13648 KB Output is correct
35 Correct 0 ms 13648 KB Output is correct
36 Correct 0 ms 13648 KB Output is correct
37 Correct 0 ms 13648 KB Output is correct
38 Correct 0 ms 13648 KB Output is correct
39 Correct 0 ms 13648 KB Output is correct
40 Correct 0 ms 13648 KB Output is correct
41 Correct 0 ms 13648 KB Output is correct
42 Correct 0 ms 13648 KB Output is correct
43 Correct 0 ms 13648 KB Output is correct
44 Correct 0 ms 13648 KB Output is correct
45 Correct 0 ms 13648 KB Output is correct
46 Correct 0 ms 13648 KB Output is correct
47 Correct 0 ms 13648 KB Output is correct
48 Correct 0 ms 13648 KB Output is correct
49 Correct 0 ms 13648 KB Output is correct
50 Correct 0 ms 13648 KB Output is correct
51 Correct 0 ms 13648 KB Output is correct
52 Correct 0 ms 13648 KB Output is correct
53 Correct 0 ms 13648 KB Output is correct

Subtask #4
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 13648 KB Output is correct
2 Correct 0 ms 13648 KB Output is correct
3 Correct 0 ms 13648 KB Output is correct
4 Correct 0 ms 13648 KB Output is correct
5 Correct 0 ms 13648 KB Output is correct
6 Correct 0 ms 13648 KB Output is correct
7 Correct 0 ms 13648 KB Output is correct
8 Correct 0 ms 13648 KB Output is correct
9 Correct 0 ms 13648 KB Output is correct
10 Correct 0 ms 13648 KB Output is correct
11 Correct 0 ms 13648 KB Output is correct
12 Correct 0 ms 13648 KB Output is correct
13 Correct 0 ms 13648 KB Output is correct
14 Correct 0 ms 13648 KB Output is correct
15 Correct 0 ms 13648 KB Output is correct
16 Correct 0 ms 13648 KB Output is correct
17 Correct 0 ms 13648 KB Output is correct
18 Correct 0 ms 13648 KB Output is correct
19 Correct 0 ms 13648 KB Output is correct
20 Correct 0 ms 13648 KB Output is correct
21 Correct 0 ms 13648 KB Output is correct
22 Correct 0 ms 13648 KB Output is correct
23 Correct 0 ms 13648 KB Output is correct
24 Correct 0 ms 13648 KB Output is correct
25 Correct 0 ms 13648 KB Output is correct
26 Correct 0 ms 13648 KB Output is correct
27 Correct 0 ms 13648 KB Output is correct
28 Correct 0 ms 13648 KB Output is correct
29 Correct 0 ms 13648 KB Output is correct
30 Correct 0 ms 13648 KB Output is correct
31 Correct 0 ms 13648 KB Output is correct
32 Correct 0 ms 13648 KB Output is correct
33 Correct 0 ms 13648 KB Output is correct
34 Correct 0 ms 13648 KB Output is correct
35 Correct 0 ms 13648 KB Output is correct
36 Correct 0 ms 13648 KB Output is correct
37 Correct 0 ms 13648 KB Output is correct
38 Correct 0 ms 13648 KB Output is correct
39 Correct 0 ms 13648 KB Output is correct
40 Correct 0 ms 13648 KB Output is correct
41 Correct 0 ms 13648 KB Output is correct
42 Correct 0 ms 13648 KB Output is correct
43 Correct 0 ms 13648 KB Output is correct
44 Correct 0 ms 13648 KB Output is correct
45 Correct 0 ms 13648 KB Output is correct
46 Correct 0 ms 13648 KB Output is correct
47 Correct 0 ms 13648 KB Output is correct
48 Correct 0 ms 13648 KB Output is correct
49 Correct 0 ms 13648 KB Output is correct
50 Correct 0 ms 13648 KB Output is correct
51 Correct 0 ms 13648 KB Output is correct
52 Correct 0 ms 13648 KB Output is correct
53 Correct 0 ms 13648 KB Output is correct
54 Correct 0 ms 13648 KB Output is correct
55 Correct 3 ms 13648 KB Output is correct
56 Correct 6 ms 13648 KB Output is correct
57 Correct 6 ms 13648 KB Output is correct
58 Correct 6 ms 13648 KB Output is correct
59 Correct 6 ms 13648 KB Output is correct
60 Correct 0 ms 13648 KB Output is correct
61 Correct 6 ms 13648 KB Output is correct
62 Correct 3 ms 13648 KB Output is correct
63 Correct 0 ms 13648 KB Output is correct
64 Correct 6 ms 13648 KB Output is correct
65 Correct 3 ms 13648 KB Output is correct
66 Correct 6 ms 13648 KB Output is correct
67 Correct 3 ms 13648 KB Output is correct
68 Correct 0 ms 13648 KB Output is correct
69 Correct 6 ms 13648 KB Output is correct

Subtask #5
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 13648 KB Output is correct
2 Correct 0 ms 13648 KB Output is correct
3 Correct 0 ms 13648 KB Output is correct
4 Correct 0 ms 13648 KB Output is correct
5 Correct 0 ms 13648 KB Output is correct
6 Correct 0 ms 13648 KB Output is correct
7 Correct 0 ms 13648 KB Output is correct
8 Correct 0 ms 13648 KB Output is correct
9 Correct 0 ms 13648 KB Output is correct
10 Correct 0 ms 13648 KB Output is correct
11 Correct 0 ms 13648 KB Output is correct
12 Correct 0 ms 13648 KB Output is correct
13 Correct 0 ms 13648 KB Output is correct
14 Correct 0 ms 13648 KB Output is correct
15 Correct 0 ms 13648 KB Output is correct
16 Correct 0 ms 13648 KB Output is correct
17 Correct 0 ms 13648 KB Output is correct
18 Correct 0 ms 13648 KB Output is correct
19 Correct 0 ms 13648 KB Output is correct
20 Correct 0 ms 13648 KB Output is correct
21 Correct 0 ms 13648 KB Output is correct
22 Correct 0 ms 13648 KB Output is correct
23 Correct 0 ms 13648 KB Output is correct
24 Correct 0 ms 13648 KB Output is correct
25 Correct 0 ms 13648 KB Output is correct
26 Correct 0 ms 13648 KB Output is correct
27 Correct 0 ms 13648 KB Output is correct
28 Correct 0 ms 13648 KB Output is correct
29 Correct 0 ms 13648 KB Output is correct
30 Correct 0 ms 13648 KB Output is correct
31 Correct 0 ms 13648 KB Output is correct
32 Correct 0 ms 13648 KB Output is correct
33 Correct 0 ms 13648 KB Output is correct
34 Correct 0 ms 13648 KB Output is correct
35 Correct 0 ms 13648 KB Output is correct
36 Correct 0 ms 13648 KB Output is correct
37 Correct 0 ms 13648 KB Output is correct
38 Correct 0 ms 13648 KB Output is correct
39 Correct 0 ms 13648 KB Output is correct
40 Correct 0 ms 13648 KB Output is correct
41 Correct 0 ms 13648 KB Output is correct
42 Correct 0 ms 13648 KB Output is correct
43 Correct 0 ms 13648 KB Output is correct
44 Correct 0 ms 13648 KB Output is correct
45 Correct 0 ms 13648 KB Output is correct
46 Correct 0 ms 13648 KB Output is correct
47 Correct 0 ms 13648 KB Output is correct
48 Correct 0 ms 13648 KB Output is correct
49 Correct 0 ms 13648 KB Output is correct
50 Correct 0 ms 13648 KB Output is correct
51 Correct 0 ms 13648 KB Output is correct
52 Correct 0 ms 13648 KB Output is correct
53 Correct 0 ms 13648 KB Output is correct
54 Correct 0 ms 13648 KB Output is correct
55 Correct 3 ms 13648 KB Output is correct
56 Correct 6 ms 13648 KB Output is correct
57 Correct 6 ms 13648 KB Output is correct
58 Correct 6 ms 13648 KB Output is correct
59 Correct 6 ms 13648 KB Output is correct
60 Correct 0 ms 13648 KB Output is correct
61 Correct 6 ms 13648 KB Output is correct
62 Correct 3 ms 13648 KB Output is correct
63 Correct 0 ms 13648 KB Output is correct
64 Correct 6 ms 13648 KB Output is correct
65 Correct 3 ms 13648 KB Output is correct
66 Correct 6 ms 13648 KB Output is correct
67 Correct 3 ms 13648 KB Output is correct
68 Correct 0 ms 13648 KB Output is correct
69 Correct 6 ms 13648 KB Output is correct
70 Correct 13 ms 13648 KB Output is correct
71 Correct 136 ms 13648 KB Output is correct
72 Correct 113 ms 13648 KB Output is correct
73 Correct 139 ms 13648 KB Output is correct
74 Correct 99 ms 13648 KB Output is correct
75 Correct 116 ms 13648 KB Output is correct
76 Correct 126 ms 13648 KB Output is correct
77 Correct 53 ms 13648 KB Output is correct
78 Correct 133 ms 13648 KB Output is correct
79 Correct 139 ms 13648 KB Output is correct
80 Correct 123 ms 13648 KB Output is correct
81 Correct 23 ms 13648 KB Output is correct
82 Correct 93 ms 13648 KB Output is correct
83 Correct 139 ms 13648 KB Output is correct
84 Correct 149 ms 13648 KB Output is correct
85 Correct 143 ms 13648 KB Output is correct
86 Correct 133 ms 13648 KB Output is correct
87 Correct 139 ms 13648 KB Output is correct
88 Correct 23 ms 13648 KB Output is correct
89 Correct 73 ms 13648 KB Output is correct
90 Correct 59 ms 13648 KB Output is correct
91 Correct 0 ms 13648 KB Output is correct
92 Correct 56 ms 13648 KB Output is correct