제출 #210696

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
210696		peuch	게임 (IOI14_game)	C++17	42 / 100	1090 ms	2572 KiB

game

#include "game.h"
#include <bits/stdc++.h>
using namespace std;

const int MAXN = 1600;

int marcAux;
int marc[MAXN], ponte[MAXN][MAXN], temp[MAXN];
int N, t;

vector<int> ar[MAXN];

int dfs(int cur, int pai){  
    int menor = temp[cur] = t++;
    marc[cur] = marcAux;
    int filhos = 0;
    for(int i = 0; i < ar[cur].size(); i++){
    	int viz = ar[cur][i];
       	if(marc[viz] != marcAux){
          	filhos++;
          	int m = dfs(viz, cur);
          	menor = min(menor, m);
          	if(temp[cur] < m)
              	ponte[cur][viz] = 1, ponte[viz][cur] = 1;
      	}
      	else if(viz != pai)
          	menor = min(menor, temp[viz]);
    } 
    return menor;      
}

void initialize(int n) {
	N = n;
	for(int i = 0; i < n; i++){
		for(int j = i + 1; j < n; j++){
			ar[i].push_back(j);
			ar[j].push_back(i);
		}
	}
}

int hasEdge(int u, int v){
	//printf("\t%d\n", ponte[u][v]);
	if(ponte[u][v] == 1) return 1;
	else{
		int id = -1;
		for(int i = 0; i < ar[u].size(); i++)
			if(ar[u][i] == v) id = i;
		if(id < 0) return 0;
		ar[u].erase(ar[u].begin() + id);
		for(int i = 0; i < ar[v].size(); i++)
			if(ar[v][i] == u) id = i;
		if(id < 0) return 0;
		ar[v].erase(ar[v].begin() + id);
		marcAux++;
		t = 1;
		dfs(0, -1);
		return 0;
	}
}

컴파일 시 표준 에러 (stderr) 메시지

game.cpp: In function 'int dfs(int, int)':
game.cpp:17:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0; i < ar[cur].size(); i++){
                    ~~^~~~~~~~~~~~~~~~
game.cpp: In function 'int hasEdge(int, int)':
game.cpp:47:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i = 0; i < ar[u].size(); i++)
                  ~~^~~~~~~~~~~~~~
game.cpp:51:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i = 0; i < ar[v].size(); i++)
                  ~~^~~~~~~~~~~~~~

• Subtask 1: 15 / 15
• Subtask 2: 27 / 27
• Subtask 3: 0 / 58