MSBOP 2015 Round2B register

Ended

Participants:6187

Verdict:AC | RE
Submitted:2015-04-26 14:27:56

Lang:G++

Edit
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
31
#include <stdio.h>
main()
{
    int a[200][200],s[200],flag,n,m,k,i,j,q,x,y,z,sum,u,t;
    scanf("%d",&t);
    for (u=1;u<=t;u++)
    {
        printf("Case #%d:\n",u);
        scanf("%d%d%d",&n,&m,&q);
        for (i=1;i<=n;i++)
         for (j=1;j<=n;j++)
          a[i][j]=0;
        for (i=1;i<=n;i++) scanf("%d",&s[i]);
        for (i=0;i<m;i++)
        {
            scanf("%d%d%d",&x,&y,&z);
            a[x][y]=z;
            a[y][x]=z;
        }
        for (i=0;i<q;i++)
        {
            scanf("%d",&flag);
            if (flag==1)
            {
                scanf("%d",&k);
                s[k]=1-s[k];
            }
            else 
            if (flag==2)
            {
                scanf("%d%d%d",&x,&y,&z);
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX