Submission #558602

# Submission time Handle Problem Language Result Execution time Memory
558602 2022-05-07T15:16:41 Z savacska Broken Device 2 (JOI22_device2) C++17
10 / 100
774 ms 524288 KB
#include "Anna.h"
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define x first
#define y second

using namespace std;

typedef long long ll;
typedef long double ld;

namespace
{
 	const int LEN = 2000;
}

int Declare()
{
	return LEN;
}

pair <vector <int>, vector <int> > Anna(ll A)
{
	for (int i = 1; i <= LEN; i++)
	{
	 	if (2ll * i + 1 >= A)
	 	{
	 		A--;
	 		vector <int> s(i), t(i);
	 		for (int j = 0; j < i; j++)
	 			if (A > 0) s[j] = 1, A--;
	 		for (int j = 0; j < i; j++)
	 			if (A > 0) t[j] = 1, A--;
	 		return mp(s, t);
	 	}
	 	A -= 2ll * i + 1;
	}
}
#include "Bruno.h"
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define x first
#define y second

using namespace std;

typedef long long ll;
typedef long double ld;

namespace
{
	const int LEN = 2000;
}


ll Bruno(vector <int> u)
{
	ll cur = 0;
	for (int i = 1; 2 * i < (int) u.size(); i++)
		cur += 2 * i + 1;

	int sum = 0;
	for (int c : u) sum += c;

	cur += sum + 1;
	return cur;
}

Compilation message

Anna.cpp: In function 'std::pair<std::vector<int>, std::vector<int> > Anna(ll)':
Anna.cpp:39:1: warning: control reaches end of non-void function [-Wreturn-type]
   39 | }
      | ^
# Verdict Execution time Memory Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 17 ms 908 KB Output is correct
3 Correct 22 ms 1112 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 17 ms 908 KB Output is correct
3 Correct 22 ms 1112 KB Output is correct
4 Correct 539 ms 22064 KB Output is correct
5 Correct 511 ms 22004 KB Output is correct
6 Correct 518 ms 22244 KB Output is correct
7 Correct 535 ms 21640 KB Output is correct
8 Correct 528 ms 22336 KB Output is correct
9 Correct 774 ms 32484 KB Output is correct
10 Correct 738 ms 32628 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 17 ms 908 KB Output is correct
3 Correct 22 ms 1112 KB Output is correct
4 Correct 539 ms 22064 KB Output is correct
5 Correct 511 ms 22004 KB Output is correct
6 Correct 518 ms 22244 KB Output is correct
7 Correct 535 ms 21640 KB Output is correct
8 Correct 528 ms 22336 KB Output is correct
9 Correct 774 ms 32484 KB Output is correct
10 Correct 738 ms 32628 KB Output is correct
11 Incorrect 1 ms 652 KB Wrong Answer [3]
12 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 17 ms 908 KB Output is correct
3 Correct 22 ms 1112 KB Output is correct
4 Correct 539 ms 22064 KB Output is correct
5 Correct 511 ms 22004 KB Output is correct
6 Correct 518 ms 22244 KB Output is correct
7 Correct 535 ms 21640 KB Output is correct
8 Correct 528 ms 22336 KB Output is correct
9 Correct 774 ms 32484 KB Output is correct
10 Correct 738 ms 32628 KB Output is correct
11 Incorrect 1 ms 652 KB Wrong Answer [3]
12 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 17 ms 908 KB Output is correct
3 Correct 22 ms 1112 KB Output is correct
4 Correct 539 ms 22064 KB Output is correct
5 Correct 511 ms 22004 KB Output is correct
6 Correct 518 ms 22244 KB Output is correct
7 Correct 535 ms 21640 KB Output is correct
8 Correct 528 ms 22336 KB Output is correct
9 Correct 774 ms 32484 KB Output is correct
10 Correct 738 ms 32628 KB Output is correct
11 Incorrect 1 ms 652 KB Wrong Answer [3]
12 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Runtime error 446 ms 524288 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -