QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#31734	#3820. Antisocial network	luanaamorim	Compile Error	/	/	C++	1.2kb	2022-05-12 01:23:55	2022-05-18 04:29:02

Judging History

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

[2023-08-10 23:21:45]
System Update: QOJ starts to keep a history of the judgings of all the submissions.

[2022-05-18 04:29:02]
评测

测评结果：Compile Error
用时：0ms
内存：0kb

查看

[2022-05-12 01:23:55]
提交

answer

#include <iostream>
#include <queue>
#include <string>
#include <algorithm>
#include <vector>
#include <cmath>
#include <iomanip>
#include <map>
#include <cstring>
#include <set>
#include <stack>
#include <bitset>
#define ll long long
#define INF (1e9)
#define MAX (int) (2e5 + 5)
#define MOD 1000000007
#define par pair<int, int>
#define all(v) v.begin(), v.end()
#define sz(x) (int) ((x).size())
#define esq(x) (x<<1)
#define dir(x) ((x<<1)|1)
#define lsb(x) (x & -x)
#define W(x) cout << #x << ": " << x << endl
#define Wii(x) cout << x.first << ' ' << x.second << endl
#define _ ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

using namespace std;

int n, a, b, m, k, t, sub[MAX];
bitset<MAX> arr[MAX], chor;

int main()
{_
	cin >> n >> m >> k;
	while (m--)
	{
		cin >> a >> b;
		arr[a][b] = 1;
		arr[b][a] = 1;
	}

	while (k--)
	{
		cin >> t;
		chor = 0;
		for (int i = 0; i < t; i++)
		{
			cin >> sub[i];
			chor[sub[i]] = 1;
		}

		for (int i = 0; i < t; i++)
		{
			chor[sub[i]] = 0;
			arr[sub[i]] ^= chor;
			chor[sub[i]] = 1;
		}
	}

	for (int i = 1; i <= n; i++)
		cout << (arr[i].count() ? "NIE" : "TAK") << endl;
}

源文件, 语言: C++

详细

/tmp/ccGy6eWw.o: In function `main':
answer.code:(.text.startup+0xb): relocation truncated to fit: R_X86_64_PC32 against symbol `a' defined in .bss section in /tmp/ccGy6eWw.o
answer.code:(.text.startup+0x2d): relocation truncated to fit: R_X86_64_PC32 against symbol `b' defined in .bss section in /tmp/ccGy6eWw.o
answer.code:(.text.startup+0x57): relocation truncated to fit: R_X86_64_PC32 against symbol `n' defined in .bss section in /tmp/ccGy6eWw.o
answer.code:(.text.startup+0x7c): relocation truncated to fit: R_X86_64_PC32 against symbol `m' defined in .bss section in /tmp/ccGy6eWw.o
answer.code:(.text.startup+0x8b): relocation truncated to fit: R_X86_64_PC32 against symbol `k' defined in .bss section in /tmp/ccGy6eWw.o
answer.code:(.text.startup+0x99): relocation truncated to fit: R_X86_64_PC32 against symbol `m' defined in .bss section in /tmp/ccGy6eWw.o
answer.code:(.text.startup+0xa2): relocation truncated to fit: R_X86_64_PC32 against symbol `m' defined in .bss section in /tmp/ccGy6eWw.o
answer.code:(.text.startup+0xc3): relocation truncated to fit: R_X86_64_PC32 against symbol `a' defined in .bss section in /tmp/ccGy6eWw.o
answer.code:(.text.startup+0xd0): relocation truncated to fit: R_X86_64_PC32 against symbol `b' defined in .bss section in /tmp/ccGy6eWw.o
answer.code:(.text.startup+0x10c): relocation truncated to fit: R_X86_64_PC32 against symbol `m' defined in .bss section in /tmp/ccGy6eWw.o
answer.code:(.text.startup+0x116): additional relocation overflows omitted from the output
collect2: error: ld returned 1 exit status