Submission #3223071


Source Code Expand

#include <bits/stdc++.h>
using namespace std;
const int N = 100010;
int n,m,q,uni[N],ans[N],sz[N];
struct edge {
  int a,b;
} edg[N];
int getfa(int pos) {
  return pos == uni[pos] ? pos : uni[pos] = getfa(uni[pos]);
}
void join(int a,int b) {
  a = getfa(a);
  b = getfa(b);
  if (a == b) return;
  if (sz[a] > sz[b]) swap(a,b);
  uni[a] = b;
  sz[b] += sz[a];
}
int calc(int a,int b) {
  a = getfa(a), b = getfa(b);
  if (a == b) return sz[a];
  return sz[a] + sz[b];
}
struct data {
  int x,y,z,id;
};
struct Divide {
  int l,r,ansl,ansr;
};
vector<data> que[2];
vector<Divide> Div[2];
int main() {
  int x,y,z;
  scanf("%d%d",&n,&m);
  for (int i = 1 ; i <= m ; ++ i) {
    scanf("%d%d",&x,&y);
    edg[i] = (edge) {x,y};
  }
  scanf("%d",&q);
  for (int i = 1 ; i <= q ; ++ i) {
    scanf("%d%d%d",&x,&y,&z);
    que[0].push_back((data) {x,y,z,i});
  }
  Div[0].push_back((Divide) {0,q-1,0,n});
  int p = 0;
  while (Div[p].size()) {
    int cur = 1;
    Div[p^1].clear();
    que[p^1].clear();
    for (int i = 1 ; i <= n ; ++ i)
      uni[i] = i, sz[i] = 1;
    for (int i = 0 ; i < (int)Div[p].size() ; ++ i) {
      int num = 0;
      if (Div[p][i].ansl == Div[p][i].ansr) {
	for (int j = Div[p][i].l ; j <= Div[p][i].r ; ++ j)
	  ans[que[p][j].id] = Div[p][i].ansl;
	continue;
      }
      int mid = (Div[p][i].ansl + Div[p][i].ansr) >> 1;
      for ( ; cur <= mid ; ++ cur)
	join(edg[cur].a,edg[cur].b);
      for (int j = Div[p][i].l ; j <= Div[p][i].r ; ++ j)
	if (calc(que[p][j].x,que[p][j].y) >= que[p][j].z)
	  que[p^1].push_back(que[p][j]), ++ num;
      if (num) Div[p^1].push_back((Divide) {(int)que[p^1].size()-num,(int)que[p^1].size()-1,Div[p][i].ansl,mid});
      num = 0;
      for (int j = Div[p][i].l ; j <= Div[p][i].r ; ++ j)
	if (calc(que[p][j].x,que[p][j].y) < que[p][j].z)
	  que[p^1].push_back(que[p][j]), ++ num;
      if (num) Div[p^1].push_back((Divide) {(int)que[p^1].size()-num,(int)que[p^1].size()-1,mid+1,Div[p][i].ansr});
    }
    p ^= 1;
  }
  for (int i = 1 ; i <= q ; ++ i)
    printf("%d\n",ans[i]);
  return 0;
}

Submission Info

Submission Time
Task D - Stamp Rally
User cly_none
Language C++14 (GCC 5.4.1)
Score 0
Code Size 2135 Byte
Status WA
Exec Time 174 ms
Memory 9456 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:34:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d",&n,&m);
                      ^
./Main.cpp:36:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d",&x,&y);
                        ^
./Main.cpp:39:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&q);
                 ^
./Main.cpp:41:29: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d%d",&x,&y,&z);
                             ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 1000
Status
AC × 1
AC × 17
WA × 16
Set Name Test Cases
Sample 0_00.txt
All 0_00.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt, 1_15.txt, 1_16.txt, 1_17.txt, 1_18.txt, 1_19.txt, 1_20.txt, 1_21.txt, 1_22.txt, 1_23.txt, 1_24.txt, 1_25.txt, 1_26.txt, 1_27.txt, 1_28.txt, 1_29.txt, 1_30.txt, 1_31.txt
Case Name Status Exec Time Memory
0_00.txt AC 1 ms 256 KB
1_00.txt AC 104 ms 9456 KB
1_01.txt AC 131 ms 9328 KB
1_02.txt AC 111 ms 9456 KB
1_03.txt AC 134 ms 9072 KB
1_04.txt AC 112 ms 9456 KB
1_05.txt AC 136 ms 9200 KB
1_06.txt AC 112 ms 9456 KB
1_07.txt AC 137 ms 9200 KB
1_08.txt AC 116 ms 9456 KB
1_09.txt AC 138 ms 9200 KB
1_10.txt AC 122 ms 9328 KB
1_11.txt AC 142 ms 9200 KB
1_12.txt AC 140 ms 9328 KB
1_13.txt AC 152 ms 9200 KB
1_14.txt AC 125 ms 7792 KB
1_15.txt AC 133 ms 7536 KB
1_16.txt WA 166 ms 6384 KB
1_17.txt WA 174 ms 6384 KB
1_18.txt WA 172 ms 6384 KB
1_19.txt WA 168 ms 6384 KB
1_20.txt WA 167 ms 6384 KB
1_21.txt WA 171 ms 6384 KB
1_22.txt WA 172 ms 6384 KB
1_23.txt WA 173 ms 6384 KB
1_24.txt WA 169 ms 6512 KB
1_25.txt WA 172 ms 6384 KB
1_26.txt WA 168 ms 6384 KB
1_27.txt WA 173 ms 6384 KB
1_28.txt WA 174 ms 6384 KB
1_29.txt WA 169 ms 6512 KB
1_30.txt WA 172 ms 6384 KB
1_31.txt WA 168 ms 6384 KB