답안 #658997

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
658997	2022-11-15T18:00:04 Z	600Mihnea	새 집 (APIO18_new_home)	C++17	5 / 100	5000 ms	17344 KB

new_home

bool home = 0;

#include <bits/stdc++.h>

using namespace std;

struct Store {
  int x;
  int type;
  int first_time;
  int last_time;
};

struct Query {
  int x;
  int t;
};

const int N = (int) 3e5 + 7;
int n;
int k;
int q;
vector<int> whereType[N];
Store stores[N];
Query queries[N];

int main() {
  if (home) {
    freopen ("input.txt", "r", stdin);
  } else {
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  }
  {
    /// Read
    cin >> n >> k >> q;
    for (int i = 1; i <= n; i++) {
      cin >> stores[i].x >> stores[i].type >> stores[i].first_time >> stores[i].last_time;
    }
    for (int i = 1; i <= q; i++) {
      cin >> queries[i].x >> queries[i].t;
    }
  }
  {
    /// Normalize time
    vector<int> interestingTimes;
    for (int i = 1; i <= q; i++) {
      interestingTimes.push_back(queries[i].t);
    }
    sort(interestingTimes.begin(), interestingTimes.end());
    interestingTimes.resize(unique(interestingTimes.begin(), interestingTimes.end()) - interestingTimes.begin());
    for (int i = 1; i <= q; i++) {
      queries[i].t = lower_bound(interestingTimes.begin(), interestingTimes.end(), queries[i].t) - interestingTimes.begin();
    }
    int y = 0;
    for (int i = 1; i <= n; i++) {
      stores[i].first_time = lower_bound(interestingTimes.begin(), interestingTimes.end(), stores[i].first_time) - interestingTimes.begin();
      stores[i].last_time = lower_bound(interestingTimes.begin(), interestingTimes.end(), stores[i].last_time + 1) - interestingTimes.begin() - 1;
      if (stores[i].first_time <= stores[i].last_time) {
        stores[++y] = stores[i];
      }
    }
   n = y;
  }
  {
    /// Normalize positions

  }
  {
    /// Some more computation
    for (int i = 1; i <= n; i++) {
      whereType[stores[i].type].push_back(i);
    }
  }
  {
    /// Brute
    for (int iq = 1; iq <= q; iq++) {
      int maxDist = 0;
      for (int t = 1; t <= k; t++) {
        int minDist = (int) 1e9 + 7;
        for (auto &i : whereType[t]) {
          if (stores[i].first_time <= queries[iq].t && queries[iq].t <= stores[i].last_time) {
            minDist = min(minDist, abs(stores[i].x - queries[iq].x));
          }
        }
        maxDist = max(maxDist, minDist);
      }
      if (maxDist == (int) 1e9 + 7) {
        maxDist = -1;
      }
      cout << maxDist << "\n";
    }
  }
  return 0;
}

Compilation message

new_home.cpp: In function 'int main()':
new_home.cpp:29:13: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   29 |     freopen ("input.txt", "r", stdin);
      |     ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	7252 KB	Output is correct
2	Correct	3 ms	7252 KB	Output is correct
3	Correct	4 ms	7252 KB	Output is correct
4	Correct	3 ms	7252 KB	Output is correct
5	Correct	4 ms	7380 KB	Output is correct
6	Correct	4 ms	7380 KB	Output is correct
7	Correct	5 ms	7380 KB	Output is correct
8	Correct	5 ms	7344 KB	Output is correct
9	Correct	4 ms	7380 KB	Output is correct
10	Correct	4 ms	7380 KB	Output is correct
11	Correct	4 ms	7380 KB	Output is correct
12	Correct	5 ms	7380 KB	Output is correct
13	Correct	4 ms	7388 KB	Output is correct
14	Correct	5 ms	7380 KB	Output is correct
15	Correct	4 ms	7380 KB	Output is correct
16	Correct	6 ms	7380 KB	Output is correct
17	Correct	4 ms	7380 KB	Output is correct
18	Correct	4 ms	7380 KB	Output is correct
19	Correct	4 ms	7380 KB	Output is correct
20	Correct	5 ms	7380 KB	Output is correct
21	Correct	4 ms	7380 KB	Output is correct
22	Correct	5 ms	7380 KB	Output is correct
23	Correct	5 ms	7380 KB	Output is correct
24	Correct	5 ms	7380 KB	Output is correct
25	Correct	4 ms	7380 KB	Output is correct
26	Correct	4 ms	7380 KB	Output is correct
27	Correct	4 ms	7380 KB	Output is correct
28	Correct	4 ms	7380 KB	Output is correct
29	Correct	4 ms	7332 KB	Output is correct
30	Correct	4 ms	7292 KB	Output is correct

Subtask #2
0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	7252 KB	Output is correct
2	Correct	3 ms	7252 KB	Output is correct
3	Correct	4 ms	7252 KB	Output is correct
4	Correct	3 ms	7252 KB	Output is correct
5	Correct	4 ms	7380 KB	Output is correct
6	Correct	4 ms	7380 KB	Output is correct
7	Correct	5 ms	7380 KB	Output is correct
8	Correct	5 ms	7344 KB	Output is correct
9	Correct	4 ms	7380 KB	Output is correct
10	Correct	4 ms	7380 KB	Output is correct
11	Correct	4 ms	7380 KB	Output is correct
12	Correct	5 ms	7380 KB	Output is correct
13	Correct	4 ms	7388 KB	Output is correct
14	Correct	5 ms	7380 KB	Output is correct
15	Correct	4 ms	7380 KB	Output is correct
16	Correct	6 ms	7380 KB	Output is correct
17	Correct	4 ms	7380 KB	Output is correct
18	Correct	4 ms	7380 KB	Output is correct
19	Correct	4 ms	7380 KB	Output is correct
20	Correct	5 ms	7380 KB	Output is correct
21	Correct	4 ms	7380 KB	Output is correct
22	Correct	5 ms	7380 KB	Output is correct
23	Correct	5 ms	7380 KB	Output is correct
24	Correct	5 ms	7380 KB	Output is correct
25	Correct	4 ms	7380 KB	Output is correct
26	Correct	4 ms	7380 KB	Output is correct
27	Correct	4 ms	7380 KB	Output is correct
28	Correct	4 ms	7380 KB	Output is correct
29	Correct	4 ms	7332 KB	Output is correct
30	Correct	4 ms	7292 KB	Output is correct
31	Execution timed out	5088 ms	9440 KB	Time limit exceeded
32	Halted	0 ms	0 KB	-

Subtask #3
0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Execution timed out	5078 ms	17344 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #4
0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Execution timed out	5073 ms	16512 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #5
0 / 35.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	7252 KB	Output is correct
2	Correct	3 ms	7252 KB	Output is correct
3	Correct	4 ms	7252 KB	Output is correct
4	Correct	3 ms	7252 KB	Output is correct
5	Correct	4 ms	7380 KB	Output is correct
6	Correct	4 ms	7380 KB	Output is correct
7	Correct	5 ms	7380 KB	Output is correct
8	Correct	5 ms	7344 KB	Output is correct
9	Correct	4 ms	7380 KB	Output is correct
10	Correct	4 ms	7380 KB	Output is correct
11	Correct	4 ms	7380 KB	Output is correct
12	Correct	5 ms	7380 KB	Output is correct
13	Correct	4 ms	7388 KB	Output is correct
14	Correct	5 ms	7380 KB	Output is correct
15	Correct	4 ms	7380 KB	Output is correct
16	Correct	6 ms	7380 KB	Output is correct
17	Correct	4 ms	7380 KB	Output is correct
18	Correct	4 ms	7380 KB	Output is correct
19	Correct	4 ms	7380 KB	Output is correct
20	Correct	5 ms	7380 KB	Output is correct
21	Correct	4 ms	7380 KB	Output is correct
22	Correct	5 ms	7380 KB	Output is correct
23	Correct	5 ms	7380 KB	Output is correct
24	Correct	5 ms	7380 KB	Output is correct
25	Correct	4 ms	7380 KB	Output is correct
26	Correct	4 ms	7380 KB	Output is correct
27	Correct	4 ms	7380 KB	Output is correct
28	Correct	4 ms	7380 KB	Output is correct
29	Correct	4 ms	7332 KB	Output is correct
30	Correct	4 ms	7292 KB	Output is correct
31	Execution timed out	5088 ms	9440 KB	Time limit exceeded
32	Halted	0 ms	0 KB	-

Subtask #6
0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	7252 KB	Output is correct
2	Correct	3 ms	7252 KB	Output is correct
3	Correct	4 ms	7252 KB	Output is correct
4	Correct	3 ms	7252 KB	Output is correct
5	Correct	4 ms	7380 KB	Output is correct
6	Correct	4 ms	7380 KB	Output is correct
7	Correct	5 ms	7380 KB	Output is correct
8	Correct	5 ms	7344 KB	Output is correct
9	Correct	4 ms	7380 KB	Output is correct
10	Correct	4 ms	7380 KB	Output is correct
11	Correct	4 ms	7380 KB	Output is correct
12	Correct	5 ms	7380 KB	Output is correct
13	Correct	4 ms	7388 KB	Output is correct
14	Correct	5 ms	7380 KB	Output is correct
15	Correct	4 ms	7380 KB	Output is correct
16	Correct	6 ms	7380 KB	Output is correct
17	Correct	4 ms	7380 KB	Output is correct
18	Correct	4 ms	7380 KB	Output is correct
19	Correct	4 ms	7380 KB	Output is correct
20	Correct	5 ms	7380 KB	Output is correct
21	Correct	4 ms	7380 KB	Output is correct
22	Correct	5 ms	7380 KB	Output is correct
23	Correct	5 ms	7380 KB	Output is correct
24	Correct	5 ms	7380 KB	Output is correct
25	Correct	4 ms	7380 KB	Output is correct
26	Correct	4 ms	7380 KB	Output is correct
27	Correct	4 ms	7380 KB	Output is correct
28	Correct	4 ms	7380 KB	Output is correct
29	Correct	4 ms	7332 KB	Output is correct
30	Correct	4 ms	7292 KB	Output is correct
31	Execution timed out	5088 ms	9440 KB	Time limit exceeded
32	Halted	0 ms	0 KB	-

답안 #658997

Compilation message

Subtask #1 5.0 / 5.0

Subtask #2 0 / 7.0

Subtask #3 0 / 10.0

Subtask #4 0 / 23.0

Subtask #5 0 / 35.0

Subtask #6 0 / 20.0

Subtask #1
5.0 / 5.0

Subtask #2
0 / 7.0

Subtask #3
0 / 10.0

Subtask #4
0 / 23.0

Subtask #5
0 / 35.0

Subtask #6
0 / 20.0