第十四届蓝桥杯集训——练习解题阶段(无序阶段)-ALGO-48 算法训练 关联矩阵

#include<stdio.h>
int main()
{
	int i, ii,n,m, a[1000][2];
	scanf("%d%d", &n, &m);

	for (  i = 0; i < m; i++)
	scanf("%d%d", &a[i][0], &a[i][1]);


	for ( i = 1; i <=n; i++)
	{
		for (ii = 0; ii < m; ii++)
		{
			if (i==a[ii][0])
			{
				printf("1 ");
			}
			else
			if (i==a[ii][1])
			{
				printf("-1 ");
			}
			else
			{
				printf("0 ");
			}

		}
		printf("\n");
	}
	
	return 0;
}

#include<cstdio>

struct group
{
	int first;
	int second;
};

int main()
{
	int n,m,i,j;
	scanf("%d%d",&n,&m);
	struct group g[m];
	for(i=1;i<=m;i++)
	{
		scanf("%d%d",&g[i].first,&g[i].second);
	}
	for(i=1;i<=n;i++)
	{
		for(j=1;j<=m;j++)
		{
			if(g[j].first==i)
				printf("1 ");
			else if(g[j].second==i)
				printf("-1 ");
			else
				printf("0 ");
		}
		printf("\n");
	}
	return 0;
}

import java.io.*;

public class Main {

    public static void main(String[] args) throws IOException {
        StreamTokenizer in = new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in)));
        PrintWriter out = new PrintWriter(System.out);
        in.nextToken();
        int n = (int) in.nval;
        in.nextToken();
        int m = (int) in.nval;
        int[][] map = new int[n + 1][m];
        for (int i = 0; i < m; i++) {
            in.nextToken();
            map[(int)in.nval][i] = 1;
            in.nextToken();
            map[(int)in.nval][i] = -1;
        }
        for (int i = 1; i <= n; i++) {
            for (int j = 0; j < m; j++) out.print((map[i][j] == -1? map[i][j]: " " + map[i][j]) + " ");
            out.println();
        }
        out.close();
    }
}

n,m = map(int,input().split())
road = [ [" 0" for i in range(m)] for j in range(n) ]
for i in range(m):
    start, end = map(int,input().split())
    road[start-1][i] = " 1"
    road[end-1][i] = "-1"
for row in road:
    print(" ".join(i for i in row))