Submission #207904

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
207904	2020-03-09 11:44:41	E869120	Building Skyscrapers (CEOI19_skyscrapers)	C++14	71 / 100	933 ms	91512 KiB

skyscrapers

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <iostream>
#include <map>
#include <queue>
#include <vector>
#include <algorithm>
#include <functional>
using namespace std;
#pragma warning (disable: 4996)
int N, T, X[1 << 18], Y[1 << 18];
map<pair<int, int>, int> Map;
vector<int> G[1 << 18];
bool used[1 << 18];
void solve_subtask1() {
  for (int i = 1; i <= N; i++) Map[make_pair(X[i], Y[i])] = i;
  for (int i = 1; i <= N; i++) {
    int dx[8] = { 1, 1, 1, 0, -1, -1, -1, 0 };
    int dy[8] = { -1, 0, 1, 1, 1, 0, -1, -1 };
    for (int j = 0; j < 8; j++) {
      int ex = X[i] + dx[j], ey = Y[i] + dy[j];
      if (Map[make_pair(ex, ey)] >= 1) {
        G[i].push_back(Map[make_pair(ex, ey)]);
      }
    }
  }
  priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> Q;
  Q.push(make_pair(X[1], Y[1])); vector<int> I;
  while (!Q.empty()) {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

Compilation message (stderr)

skyscrapers.cpp:8:0: warning: ignoring #pragma warning  [-Wunknown-pragmas]
 #pragma warning (disable: 4996)
 
skyscrapers.cpp: In function 'void solve_subtask1()':
skyscrapers.cpp:45:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int i = 0; i < I.size(); i++) printf("%d\n", I[i]);
                   ~~^~~~~~~~~~
skyscrapers.cpp: In function 'void solve_subtask2()':
skyscrapers.cpp:165:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int i = 0; i < I.size(); i++) printf("%d\n", I[i]);
                   ~~^~~~~~~~~~
skyscrapers.cpp: In function 'int main()':
skyscrapers.cpp:170:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d", &N, &T);
  ~~~~~^~~~~~~~~~~~~~~~
skyscrapers.cpp:171:36: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for (int i = 1; i <= N; i++) scanf("%d%d", &X[i], &Y[i]);
                               ~~~~~^~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 8 / 8
• Subtask 2: 14 / 14
• Subtask 3: 12 / 12
• Subtask 4: 17 / 17
• Subtask 5: 20 / 20
• Subtask 6: 0 / 10
• Subtask 7: 0 / 19