Conurbation

input/code.cpp: In function 'void Test()':
input/code.cpp:61:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   61 |     freopen("temp\\in.txt", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
input/code.cpp: In function 'int main()':
input/code.cpp:67:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   67 |     scanf("%d%d%d", &n, &m, &q);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~
input/code.cpp:71:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   71 |         scanf("%d", &value[i]);
      |         ~~~~~^~~~~~~~~~~~~~~~~
input/code.cpp:77:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   77 |         scanf("%d%d%d", &B[i].x, &B...

#include<iostream>
#include<cstdio>
#include<algorithm>
typedef long long LL;

const int N=10005;

// Union&Find Start
int father[N], size[N], value[N];
 
int Find(int x)
{
    if(father[x]==x)
        return x;
    return father[x]=Find(father[x]);
}
void Union(int x, int y, int w)
{
    x = Find(x), y=Find(y);
    if(x==y)
    {
        value[x] += w;
        return;
    }
    if(size[x] < size[y])
        std::swap(x, y);
    father[y] = x;
    size[x] += size[y];
    value[x] += value[y] + w;
}
// Union&Find End

struct Query
{
    int p, v;
    int t, x;
}Q[2*N];

struct Build
{
    int x, y, w, t;
}B[2*N];

bool CMP_query(const Query& A, const Query& B)
{
    return A.t < B.t;
}
bool CMP_query_2(const Query& A, const Query& B)
{
    return A.p < B.p;
}

bool CMP_build(const Build& A, const Build& B)
{
    return A.t < B.t;
}


void Test()
{
    freopen("temp\\in.txt", "r", stdin);
}
int main()
{
    // Test();
    int n, m, q;
    scanf("%d%d%d", &n, &m, &q);
    for(int i=1; i<=n; i++)
    {
        father[i] = i;
        scanf("%d", &value[i]);
    }
    
    for(int i=1; i<=m; i++)
    {
        B[i].t = i;
        scanf("%d%d%d", &B[i].x, &B[i].y, &B[i].w);
    }
    for(int i=1; i<=q; i++)
    {
        scanf("%d%d", &Q[i].x, &Q[i].t);
        Q[i].p = i;
    }

    std::sort(Q+1, Q+q+1, CMP_query);

    int now = 0;
    for(int i=1; i<=q; i++)
    {
        int t = Q[i].t;
// printf("%d %d\n", t, now);
        while(t >= now+1)
        {
            now++;
            Union(B[now].x, B[now].y, B[now].w);
        }

        int ans = value[Find(Q[i].x)];
        Q[i].v = ans;
    }

    std::sort(Q+1, Q+q+1, CMP_query_2);

    for(int i=1; i<=q; i++)
        printf("%d ", Q[i].v);


    return 0;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED

Test 16

Verdict: ACCEPTED

Test 17

Verdict: ACCEPTED

Test 18

Verdict: ACCEPTED

Test 19

Verdict: ACCEPTED

Test 20

Verdict: ACCEPTED

Test 21

Verdict: ACCEPTED

Test 22

Verdict: ACCEPTED

Test 23

Verdict: ACCEPTED

Test 24

Verdict: ACCEPTED

Test 25

Verdict: ACCEPTED

Test 26

Verdict: ACCEPTED

Test 27

Verdict: ACCEPTED

Test 28

Verdict: ACCEPTED

Test 29

Verdict: ACCEPTED

Test 30

Verdict: ACCEPTED

Test 31

Verdict: ACCEPTED

Test 32

Verdict: ACCEPTED

Test 33

Verdict: ACCEPTED

Test 34

Verdict: ACCEPTED

Test 35

Verdict: ACCEPTED

Test 36

Verdict: ACCEPTED

Test 37

Verdict: ACCEPTED

Test 38

Verdict: ACCEPTED

Test 39

Verdict: ACCEPTED

Test 40

Verdict: ACCEPTED

Test 41

Verdict: ACCEPTED

Test 42

Verdict: ACCEPTED

Test 43

Verdict: ACCEPTED

Test 44

Verdict: ACCEPTED

Test 45

Verdict: ACCEPTED

Test 46

Verdict: ACCEPTED

Test 47

Verdict: ACCEPTED

Test 48

Verdict: ACCEPTED

Test 49

Verdict: ACCEPTED

Test 50

Verdict: ACCEPTED

Test 51

Verdict: ACCEPTED

Test 52

Verdict: ACCEPTED

Test 53

Verdict: ACCEPTED

Test 54

Verdict: ACCEPTED

Test 55

Verdict: ACCEPTED

Test 56

Verdict: ACCEPTED

Test 57

Verdict: ACCEPTED

Test 58

Verdict: ACCEPTED

Test 59

Verdict: ACCEPTED

Test 60

Verdict: ACCEPTED

Test 61

Verdict: RUNTIME ERROR

Test 62

Verdict: RUNTIME ERROR

Test 63

Verdict: RUNTIME ERROR

Test 64

Verdict: RUNTIME ERROR

Test 65

Verdict: RUNTIME ERROR

Test 66

Verdict: RUNTIME ERROR

Test 67

Verdict: RUNTIME ERROR

Test 68

Verdict: RUNTIME ERROR

Test 69

Verdict: RUNTIME ERROR