QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#385951#141. 8 染色CrysflyCompile Error//C++172.9kb2024-04-11 10:33:202024-04-11 10:33:22

Judging History

你现在查看的是最新测评结果

  • [2024-04-11 10:33:22]
  • 评测
  • [2024-04-11 10:33:20]
  • 提交

Alice

// what is matter? never mind. 
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,sse4,popcnt,abm,mmx,avx,avx2") 
#include "Alice.h"
#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(int i=(a);i>=(b);--i)
#define ll long long
//#define int long long
#define ull unsigned long long
#define SZ(x) ((int)((x).size()))
#define ALL(x) (x).begin(),(x).end()
using namespace std;
inline int read()
{
    char c=getchar();int x=0;bool f=0;
    for(;!isdigit(c);c=getchar())f^=!(c^45);
    for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
    if(f)x=-x;return x;
}

#define fi first
#define se second
#define pb push_back
#define mkp make_pair
typedef pair<int,int>pii;
typedef vector<int>vi;
 
#define maxn 1000005
#define inf 0x3f3f3f3f

int deg[maxn];

std::vector <int> Alice(int n, int m, std::vector <int> U, std::vector <int> V, std::vector <int> c){
	For(i,0,n-1) deg[i]=0;
	For(i,0,m-1) {
		int u=U[i],v=V[i];
		++deg[u],++deg[v];
	}
	vi res;
	For(i,0,n-1){
		if(deg[i]>=8){
			res.pb((c[i]>>1&1));
			res.pb((c[i]>>2&1));
		}
	}
	return res;
}

Bob

// what is matter? never mind. 
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,sse4,popcnt,abm,mmx,avx,avx2") 
#include "Bob.h"
#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(int i=(a);i>=(b);--i)
#define ll long long
//#define int long long
#define ull unsigned long long
#define SZ(x) ((int)((x).size()))
#define ALL(x) (x).begin(),(x).end()
using namespace std;
inline int read()
{
    char c=getchar();int x=0;bool f=0;
    for(;!isdigit(c);c=getchar())f^=!(c^45);
    for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
    if(f)x=-x;return x;
}

#define fi first
#define se second
#define pb push_back
#define mkp make_pair
typedef pair<int,int>pii;
typedef vector<int>vi;
 
#define maxn 1000005
#define inf 0x3f3f3f3f

int deg[maxn];
int c[maxn],col[maxn];

vi e[maxn];
void dfs(int u,int c){
	col[u]=c;
	for(int v:e[u]) if(col[v]==-1) dfs(v,!c);
}

std::vector <int> Bob(int n, int m, std::vector <int> U, std::vector <int> V, std::vector <int> x){
	For(i,0,n-1) deg[i]=0;
	For(i,0,m-1) {
		int u=U[i],v=V[i];
		++deg[u],++deg[v];
	}
	vi res; int pos=0;
	For(i,0,n-1){
		if(deg[i]>=8){
			c[i]=0;
			if(x[pos])c[i]|=2; ++pos;
			if(x[pos])c[i]|=4; ++pos;
		}
		else c[i]=-1;
	}
	For(t,0,7) if(t%2==0) {
		For(i,0,n-1) e[i].clear(),col[i]=-1;
		For(i,0,m-1){
			int u=U[i],v=V[i];
			if(c[u]==t && c[v]==t) e[u].pb(v),e[v].pb(u);
		}
		For(i,0,n-1) if(col[i]==-1) dfs(i,0);
		For(i,0,n-1) if(c[i]==t) c[i]|=col[i];
	}
	For(i,0,n-1) if(c[i]==-1) {
		vector<bool>vis(8,0);
		for(int v:e[i]) if(c[v]!=-1) vis[c[v]]=1;
		For(j,0,7) if(!vis[j]) c[i]=j;
	}
	vi res;
	For(i,0,n-1)res.pb(c[i]);
	return res;
}

Details

Bob.code: In function ‘std::vector<int> Bob(int, int, std::vector<int>, std::vector<int>, std::vector<int>)’:
Bob.code:71:12: error: redeclaration of ‘vi res’
   71 |         vi res;
      |            ^~~
Bob.code:48:12: note: ‘vi res’ previously declared here
   48 |         vi res; int pos=0;
      |            ^~~