oj.uz

Submission #212271

# Submission time Handle Problem Language Result Execution time Memory
212271 2020-03-22T16:12:32 Z model_code Birmingham (COCI20_birmingham) C++17
70 / 70
 131 ms 8568 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef double lf;
typedef long double Lf;
typedef pair <int,int> pii;
typedef pair <ll, ll> pll;

#define TRACE(x) cerr << #x << "  " << x << endl
#define FOR(i, a, b) for (int i = (a); i < int(b); i++)
#define REP(i, n) FOR(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define _ << " " <<

#define fi first
#define sec second
#define mp make_pair
#define pb push_back

const int MAXN = 100100;

int n, m, k, q;
int dist[MAXN], ans[MAXN];
int bio[MAXN];

vector <int> v[MAXN];

queue <int> Q;

void bfs() {
  int cvor;
  while (!Q.empty()) {
    cvor = Q.front();
    Q.pop();
    for (auto ncvor : v[cvor]) {
      if (bio[ncvor]) continue;
      bio[ncvor] = 1;
      Q.push(ncvor);
      dist[ncvor] = dist[cvor] + 1;
    }
  }
}

int main() {
  scanf("%d %d %d %d",&n,&m,&q,&k);
  REP(i, q) {
    int x;
    scanf("%d",&x);
    if (!bio[x]) Q.push(x);
    bio[x] = 1;
  }

  REP(i, m) {
    int a, b;
    scanf("%d %d",&a,&b);
    v[a].pb(b);
    v[b].pb(a);
  }

  bfs();

  int pt = 1, j = 1;
  while (pt < MAXN) {
    FOR(i, pt, pt + j * k) {
      if (i < MAXN) ans[i] = j;
    }
    pt += j * k;
    j++;
  }

  FOR(i, 1, n + 1) {
    printf("%d ",ans[dist[i]]);
  }
  puts("");

  return 0;
}

Compilation message

code1.cpp: In function 'int main()':
code1.cpp:46:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d %d %d",&n,&m,&q,&k);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
code1.cpp:49:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&x);
     ~~~~~^~~~~~~~~
code1.cpp:56:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d",&a,&b);
     ~~~~~^~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

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

Subtask #3
5.0 / 5.0

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

Subtask #4
5.0 / 5.0

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

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 3072 KB Output is correct
2 Correct 0 ms 3072 KB Output is correct
3 Correct 6 ms 3072 KB Output is correct
4 Correct 7 ms 3072 KB Output is correct

Subtask #6
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 3072 KB Output is correct
2 Correct 6 ms 3072 KB Output is correct
3 Correct 7 ms 3072 KB Output is correct
4 Correct 6 ms 3072 KB Output is correct

Subtask #7
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 3072 KB Output is correct
2 Correct 7 ms 3072 KB Output is correct
3 Correct 6 ms 3072 KB Output is correct
4 Correct 6 ms 3072 KB Output is correct

Subtask #8
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 129 ms 8184 KB Output is correct
2 Correct 117 ms 8440 KB Output is correct
3 Correct 113 ms 8568 KB Output is correct
4 Correct 110 ms 7972 KB Output is correct
5 Correct 95 ms 8184 KB Output is correct
6 Correct 113 ms 8440 KB Output is correct

Subtask #9
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 120 ms 8440 KB Output is correct
2 Correct 127 ms 8312 KB Output is correct
3 Correct 111 ms 8440 KB Output is correct
4 Correct 120 ms 8444 KB Output is correct
5 Correct 112 ms 8312 KB Output is correct
6 Correct 103 ms 8312 KB Output is correct

Subtask #10
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 110 ms 8312 KB Output is correct
2 Correct 127 ms 8568 KB Output is correct
3 Correct 131 ms 8488 KB Output is correct
4 Correct 124 ms 8568 KB Output is correct
5 Correct 97 ms 8184 KB Output is correct
6 Correct 103 ms 8184 KB Output is correct

Subtask #11
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 97 ms 8056 KB Output is correct
2 Correct 122 ms 8292 KB Output is correct
3 Correct 111 ms 8440 KB Output is correct
4 Correct 105 ms 8184 KB Output is correct
5 Correct 103 ms 8056 KB Output is correct
6 Correct 101 ms 8056 KB Output is correct

Subtask #12
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 100 ms 8184 KB Output is correct
2 Correct 102 ms 8184 KB Output is correct
3 Correct 103 ms 8184 KB Output is correct
4 Correct 104 ms 8184 KB Output is correct
5 Correct 117 ms 8296 KB Output is correct
6 Correct 98 ms 8056 KB Output is correct

Subtask #13
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 99 ms 8056 KB Output is correct
2 Correct 99 ms 8312 KB Output is correct
3 Correct 113 ms 8184 KB Output is correct
4 Correct 108 ms 8288 KB Output is correct
5 Correct 100 ms 8184 KB Output is correct
6 Correct 99 ms 8188 KB Output is correct

Subtask #14
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 98 ms 8184 KB Output is correct
2 Correct 93 ms 7904 KB Output is correct
3 Correct 126 ms 8568 KB Output is correct
4 Correct 112 ms 8056 KB Output is correct
5 Correct 101 ms 8312 KB Output is correct
6 Correct 111 ms 8440 KB Output is correct