QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#418753#6652. 着色LinkWish#WA 13ms3872kbC++14794b2024-05-23 15:34:162024-05-23 15:34:17

Judging History

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

  • [2024-05-23 15:34:17]
  • 评测
  • 测评结果:WA
  • 用时:13ms
  • 内存:3872kb
  • [2024-05-23 15:34:16]
  • 提交

answer

//Linkwish's code
#include<bits/stdc++.h>
#define endl '\n'
#define si static inline
#define mp make_pair
#define fi first
#define se second
using namespace std;typedef long long ll;typedef __int128 li;
typedef pair<int,int> pii;typedef pair<ll,ll> pll;typedef const int ci;
typedef const ll cl;const int iinf=INT_MAX;const ll linf=LLONG_MAX;
template<typename T>si bool gmax(T &x,const T y){if(x<y)return x=y,1;return 0;}
template<typename T>si bool gmin(T &x,const T y){if(y<x)return x=y,1;return 0;}

namespace LinkWish{
	
	void mian(){
		int n;
		cin>>n;
		for(int i=0;i<n;++i){
			for(int j=i+1;j<n;++j)cout<<10-__builtin_popcount(i^j);
			cout<<"\n";
		}
	}
}

signed main(){
	ios::sync_with_stdio(0);
	cin.tie(0),cout.tie(0);
	LinkWish::mian();
	return 0;
}

详细

Test #1:

score: 100
Accepted
time: 1ms
memory: 3528kb

input:

2

output:

9


result:

ok Accepted.

Test #2:

score: -100
Wrong Answer
time: 13ms
memory: 3872kb

input:

1000

output:

998988798878776988787768776766598878776877676658776766576656554988787768776766587767665766565548776766576656554766565546554544398878776877676658776766576656554877676657665655476656554655454438776766576656554766565546554544376656554655454436554544354434332988787768776766587767665766565548776766576656...

result:

FAIL There is a 5-cycle with the same color.