MSBOP 2015 Round2B register

Ended

Participants:6187

Verdict:AC | WA
Submitted:2015-04-26 14:33:27

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<iostream>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<vector>
using namespace std;
string s;
int N,T,M,Q,op,x,y,v;
int a[60];
int pos[60];
int gender[1010];
int honey[1010][1010];
vector<int> boy,girl;
int main(){
    cin>>T;
    for (int ca = 1; ca <= T; ca++){
        cin>>N>>M>>Q;
        memset(honey,0,sizeof honey);
        printf("Case #%d:\n",ca);
        for (int i = 1; i <= N; i++){
            cin>>gender[i];
        }
        for (int i = 1; i <= M; i++){
            cin>>x>>y>>v;
            honey[x][y] = v;
            honey[y][x] = v;
        }
        for (int i = 1; i <= Q; i++){
            cin>>op;
            if (op == 1){
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX