CSES - Datatähti 2019 alku

CSES - Datatähti 2019 alku - Results

Submission details
Task:	Ruudukko
Sender:	N00B.exe
Submission time:	2018-10-13 22:16:46 +0300
Language:	C++
Status:	READY
Result:	0

Feedback
group	verdict	score
#1	WRONG ANSWER	0
#2	WRONG ANSWER	0
#3	WRONG ANSWER	0

Test results
test	verdict	time	group
#1	ACCEPTED	0.03 s	1	details
#2	ACCEPTED	0.02 s	1	details
#3	ACCEPTED	0.01 s	1	details
#4	ACCEPTED	0.01 s	1	details
#5	WRONG ANSWER	0.03 s	1	details
#6	WRONG ANSWER	0.03 s	1	details
#7	WRONG ANSWER	0.02 s	1	details
#8	WRONG ANSWER	0.02 s	1	details
#9	ACCEPTED	0.02 s	1	details
#10	TIME LIMIT EXCEEDED	--	1	details
#11	WRONG ANSWER	0.02 s	2	details
#12	WRONG ANSWER	0.02 s	2	details
#13	WRONG ANSWER	0.02 s	2	details
#14	WRONG ANSWER	0.02 s	2	details
#15	WRONG ANSWER	0.03 s	2	details
#16	WRONG ANSWER	0.04 s	2	details
#17	WRONG ANSWER	0.03 s	2	details
#18	WRONG ANSWER	0.04 s	2	details
#19	WRONG ANSWER	0.03 s	2	details
#20	WRONG ANSWER	0.03 s	2	details
#21	WRONG ANSWER	0.17 s	3	details
#22	WRONG ANSWER	0.04 s	3	details
#23	WRONG ANSWER	0.03 s	3	details
#24	WRONG ANSWER	0.03 s	3	details
#25	ACCEPTED	0.04 s	3	details
#26	WRONG ANSWER	0.18 s	3	details
#27	WRONG ANSWER	0.05 s	3	details
#28	WRONG ANSWER	0.04 s	3	details
#29	WRONG ANSWER	0.04 s	3	details
#30	ACCEPTED	0.03 s	3	details

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:8:35: warning: format '%d' expects argument of type 'int', but argument 2 has type 'll {aka long long int}' [-Wformat=]
 #define PRTI(num) printf("%d", num)
                                   ^
input/code.cpp:95:3: note: in expansion of macro 'PRTI'
   PRTI(f);
   ^~~~
input/code.cpp:7:42: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define FOR(num, n) for(int num = 0; num < n; num++)
input/code.cpp:231:6:
  FOR(i, factors.size())
      ~~~~~~~~~~~~~~~~~                    
input/code.cpp:231:2: note: in expansion of macro 'FOR'
  FOR(i, factors.size())
  ^~~
input/code.cpp:34:6: warning: unused variable 'bitAmount' [-Wunused-variable]
  int bitAmount = n * n;
      ^~~~~~~~~
input/code.cpp:11:24: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
 #define SCNI(num) scanf("%d", &num)
                   ~~~~~...

Code

#include <iostream>
#include <bitset>
#include <unordered_set>
#include <vector>
#include <stdio.h>
#define PAUSE getchar();getchar()
#define FOR(num, n) for(int num = 0; num < n; num++)
#define PRTI(num) printf("%d", num)
#define PRT(s) printf("%s", s)
#define LBRK printf("\n");
#define SCNI(num) scanf("%d", &num)
#define SCNC(ch) scanf("%c", &ch)
#define USETI unordered_set<int>
#define NSRT(container, val) container.insert(val)
#define CNT(container, val) container.count(val)
#define ERS(container, val) container.erase(val)
#define VADD(container, val) container.push_back(val)
#define VECTI vector<int>
#define PRINTSITUATION LBRK; FOR(i, n) { FOR(k, n) { int b = bits[i*n + k]; PRTI(b);} LBRK;} LBRK
#define MODNUMBER 1000000007

typedef long long ll;

using namespace std;

int main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(0);

	int n;
	SCNI(n);

	int bitAmount = n * n;
	bitset<4000000> bits;

	USETI a, b, a2, b2;
	VECTI factors;

	FOR(i, n)
	{
		NSRT(a, i);
		NSRT(b, i);
		NSRT(a2, i);
		NSRT(b2, i);
	}

	char c;
	bool noChars = true;

	FOR(i, n)
	{
		FOR(k, n)
		{

			SCNC(c);
			
			if(c == '\n')
			{ SCNC(c); }

			if(c == 'A')
			{
				ERS(a, i);
				ERS(a2, k);
				bits[(i*n+k)] = 1;
				noChars = false;
			}

			else if (c == 'B')
			{
				ERS(b, i);
				ERS(b2, k);
				bits[(i*n + k)] = 1;
				noChars = false;
			}
		}
	}

	if(noChars)
	{
		ll f = 1;
		FOR(i, n)
		{
			ll l = n - i;
			ll m = n - i - 1;
			
			if(l <= 1)
			{ break; }

			f = (f * l) % MODNUMBER;
			f = (f * m) % MODNUMBER;

		}

		PRTI(f);

		return 0;
	}

	//LBRK;
	//PAUSE;

	int min = 2147483647;
	int index = -1;

	while(min > 1)
	{
		min = 2147483647;
		index = -1;

		FOR(i, n)
		{
			if (CNT(a, i) == 0)
			{ continue; }

			int p = 0;
			FOR(k, n)
			{
				if (CNT(a2, k) == 0)
				{ continue; }

				if (bits[(i*n + k)] != 1)
				{ p++; }
			}

			if (p < min)
			{ min = p; index = i; }

		}

		VADD(factors, min);

		FOR(k, n)
		{
			if (CNT(a2, k) == 0)
			{ continue; }

			if (bits[(index*n + k)] != 1)
			{
				ERS(a, index);
				ERS(a2, k);
				bits[(index*n + k)] = 1;
				break;
			}
		}

		/*
		LBRK;
		PRTI(min);
		LBRK;
		PRTI(index);

		LBRK;
		PRINTSITUATION;
		LBRK;

		PAUSE;
		PAUSE;
		*/
	}

	min = 2147483647;
	index = -1;

	while (min > 1)
	{
		min = 2147483647;
		index = -1;
		FOR(i, n)
		{
			if (CNT(b, i) == 0)
			{
				continue;
			}

			int p = 0;
			FOR(k, n)
			{
				if (CNT(b2, k) == 0)
				{
					continue;
				}

				if (bits[(i*n + k)] != 1)
				{
					p++;
				}
			}

			if (p < min)
			{
				min = p; index = i;
			}

		}

		VADD(factors, min);

		FOR(k, n)
		{
			if (CNT(b2, k) == 0)
			{
				continue;
			}

			if (bits[(index*n + k)] != 1)
			{
				ERS(b, index);
				ERS(b2, k);
				bits[(index*n + k)] = 1;
				break;
			}
		}

		/*
		LBRK;
		PRTI(min);
		LBRK;
		PRTI(index);

		LBRK;
		PRINTSITUATION;
		LBRK;

		PAUSE;
		PAUSE;
		*/
	}

	int ans = 1;
	FOR(i, factors.size())
	{ ans *= factors[i]; }
	
	PRTI(ans);

	//PAUSE;
	//PAUSE;

    return 0;
}

Test details

Test 1

Group: 1

Verdict: ACCEPTED

input
`2 .. ..` view save

correct output
`2` view save

user output
`2` view save

Test 2

Group: 1

Verdict: ACCEPTED

input
`2 .. A.` view save

correct output
`1` view save

user output
`1` view save

Test 3

Group: 1

Verdict: ACCEPTED

input
`2 B. .A` view save

correct output
`0` view save

user output
`0` view save

Test 4

Group: 1

Verdict: ACCEPTED

input
`3 ... ... ...` view save

correct output
`12` view save

user output
`12` view save

Test 5

Group: 1

Verdict: WRONG ANSWER

input
`4 .... .... .... ....` view save

correct output
`216` view save

user output
`144` view save

Test 6

Group: 1

Verdict: WRONG ANSWER

input
`5 ..... ..... ..... ..... ...` view save

correct output
`5280` view save

user output
`2880` view save

Test 7

Group: 1

Verdict: WRONG ANSWER

input
`5 ....A ..... ..... ..... ...` view save

correct output
`264` view save

user output
`288` view save

Test 8

Group: 1

Verdict: WRONG ANSWER

input
`5 B.... ..... ..... .A.B. ...` view save

correct output
`22` view save

user output
`36` view save

Test 9

Group: 1

Verdict: ACCEPTED

input
`5 B.A.. ....A ..... A.B.. ...` view save

correct output
`2` view save

user output
`2` view save

Test 10

Group: 1

Verdict: TIME LIMIT EXCEEDED

input
`5 A.B.. BA... .B.A. ...BA ...` view save

correct output
`1` view save

user output
(empty)

Test 11

Group: 2

Verdict: WRONG ANSWER

input
`10 .......... .......... .......... .......... ...` view save

correct output
`306442892` view save

user output
`818934788` view save

Test 12

Group: 2

Verdict: WRONG ANSWER

input
`50 .................................` view save

correct output
`694861480` view save

user output
`310795856` view save

Test 13

Group: 2

Verdict: WRONG ANSWER

input
`111 .................................` view save

correct output
`555319110` view save

user output
`399920258` view save

Test 14

Group: 2

Verdict: WRONG ANSWER

input
`222 .................................` view save

correct output
`108372237` view save

user output
`81630681` view save

Test 15

Group: 2

Verdict: WRONG ANSWER

input
`333 .................................` view save

correct output
`259107857` view save

user output
`847927728` view save

Test 16

Group: 2

Verdict: WRONG ANSWER

input
`444 .................................` view save

correct output
`19906314` view save

user output
`195043943` view save

Test 17

Group: 2

Verdict: WRONG ANSWER

input
`497 .................................` view save

correct output
`224313667` view save

user output
`887529205` view save

Test 18

Group: 2

Verdict: WRONG ANSWER

input
`498 .................................` view save

correct output
`929574601` view save

user output
`801875054` view save

Test 19

Group: 2

Verdict: WRONG ANSWER

input
`499 .................................` view save

correct output
`600226043` view save

user output
`553274239` view save

Test 20

Group: 2

Verdict: WRONG ANSWER

input
`500 .................................` view save

correct output
`198353194` view save

user output
`921664213` view save

Test 21

Group: 3

Verdict: WRONG ANSWER

input
`499 .................................` view save

correct output
`840243733` view save

user output
`0` view save

Test 22

Group: 3

Verdict: WRONG ANSWER

input
`499 ........................A........` view save

correct output
`4146290` view save

user output
`0` view save

Test 23

Group: 3

Verdict: WRONG ANSWER

input
`499 B.........A......................` view save

correct output
`173518884` view save

user output
`-381681664` view save

Test 24

Group: 3

Verdict: WRONG ANSWER

input
`499 ...A....B........................` view save

correct output
`20044800` view save

user output
`18144000` view save

Test 25

Group: 3

Verdict: ACCEPTED

input
`499 AB...............................` view save

correct output
`2` view save

user output
`2` view save

Test 26

Group: 3

Verdict: WRONG ANSWER

input
`500 .................................` view save

correct output
`121064146` view save

user output
`0` view save

Test 27

Group: 3

Verdict: WRONG ANSWER

input
`500 .................................` view save

correct output
`848435259` view save

user output
`0` view save

Test 28

Group: 3

Verdict: WRONG ANSWER

input
`500 .....B........A..................` view save

correct output
`296240911` view save

user output
`871890944` view save

Test 29

Group: 3

Verdict: WRONG ANSWER

input
`500 .A......B........................` view save

correct output
`2196` view save

user output
`1728` view save

Test 30

Group: 3

Verdict: ACCEPTED

input
`500 ...AB............................` view save

correct output
`1` view save

user output
`1` view save

Datatähti 2019 alku

Ruudukko

Compiler report

Code

Test details

Test 1

Test 2

Test 3

Test 4

Test 5

Test 6

Test 7

Test 8

Test 9

Test 10

Test 11

Test 12

Test 13

Test 14

Test 15

Test 16

Test 17

Test 18

Test 19

Test 20

Test 21

Test 22

Test 23

Test 24

Test 25

Test 26

Test 27

Test 28

Test 29

Test 30

Tasks

Submissions (N00B.exe)