oj.uz

답안 #169459

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
169459 2019-12-20T13:32:03 Z Nucleist Simurgh (IOI17_simurgh) C++14
0 / 100
 10 ms 376 KB 
#include "simurgh.h"
#include <bits/stdc++.h> 
using namespace std; 
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#define flash ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define debug(x) cerr << " - " << #x << ": " << x << endl;
#define debugs(x, y) cerr << " - " << #x << ": " << x << " " << #y << ": " << y << endl;
#define all(x) (x).begin(),(x).end()
#define sz(x) (ll)x.size()
#define ll long long
#define INF 1000000000
#define MOD 1000000007
#define pb push_back
#define ve vector<ll>
#define dos pair<ll,ll>
#define vedos vector<dos>
#define rand mt19937 rng(chrono::steady_clock::now().time_since_epoch().count())
struct greateri
{
    template<class T>
    bool operator()(T const &a, T const &b) const { return a > b; }
};
vector<int> edges;
map<pair<int,int>,int>gg,gg1;
bool vis[501];
vector<int>graph[501];
int counter;
int na;
vector<int> yay;
bool ka;
ve yup;
set<int>cup;
int tab[8];
vector<int> find_roads(int n, vector<int> u, vector<int> v) {
	for (int i = 0; i < u.size(); ++i)
	{
		gg[{min(u[i],v[i]),max(u[i],v[i])}]=i;
		//gg1[{min(u[i],v[i]),max(u[i],v[i])}]=1;
		graph[u[i]].pb(v[i]);
		graph[v[i]].pb(u[i]);
		//debugs(u[i],v[i]);
	}
	for (int i = 0; i < n; ++i)
	{
	tab[i]=i;
	}
	na=n;
	do {
		vector<int>kahba;
		//cout<<tab[0]<<" ";
		for (int i = 1; i < n; ++i)
		{
			//cout<<tab[i]<<" ";
			if(gg.find({min(tab[i],tab[i-1]),max(tab[i],tab[i-1])})!=gg.end())
			{
				//debugs(tab[i],tab[i-1]);
				kahba.pb(gg[{min(tab[i],tab[i-1]),max(tab[i],tab[i-1])}]);
			}
		}
		//cout<<endl;
		if(kahba.size()==(n-1))
		{
			int dol = count_common_roads(kahba);
			//debug(dol);
			if(dol==(n-1))
				return kahba;
		}
	}while (next_permutation(tab, tab + n));
}

Compilation message

simurgh.cpp:5:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization ("O3")
 
simurgh.cpp:6:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization ("unroll-loops")
 
simurgh.cpp: In function 'std::vector<int> find_roads(int, std::vector<int>, std::vector<int>)':
simurgh.cpp:37:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < u.size(); ++i)
                  ~~^~~~~~~~~~
simurgh.cpp:63:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   if(kahba.size()==(n-1))
      ~~~~~~~~~~~~^~~~~~~
simurgh.cpp:71:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

Subtask #1
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 376 KB WA in grader: NO
2 Halted 0 ms 0 KB -

Subtask #2
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 376 KB WA in grader: NO
2 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 376 KB WA in grader: NO
2 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB correct
2 Incorrect 10 ms 256 KB WA in grader: NO
3 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 376 KB WA in grader: NO
2 Halted 0 ms 0 KB -