oj.uz

Submission #44524

# Submission time Handle Problem Language Result Execution time Memory
44524 2018-04-02T21:16:45 Z MatheusLealV Coins (IOI17_coins) C++17
100 / 100
 13 ms 1640 KB 
#include <bits/stdc++.h>
using namespace std;

vector<int> coin_flips(vector<int> a, int x)
{
	int X = 0;

	for(int i = 0; i < a.size(); i++) if(a[i]) X ^= i;

	vector<int> F;

	F.push_back(X ^ x);

	return F;
}

int find_coin(vector<int> a)
{
	int X = 0;

	for(int i = 0; i < a.size(); i++) if(a[i]) X ^= i;

	return X;
}

Compilation message

coins.cpp: In function 'std::vector<int> coin_flips(std::vector<int>, int)':
coins.cpp:8:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i < a.size(); i++) if(a[i]) X ^= i;
                 ~~^~~~~~~~~~
coins.cpp: In function 'int find_coin(std::vector<int>)':
coins.cpp:21:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i < a.size(); i++) if(a[i]) X ^= i;
                 ~~^~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 1500 KB Output is correct
2 Correct 12 ms 1340 KB Output is correct
3 Correct 12 ms 1328 KB Output is correct
4 Correct 12 ms 1472 KB Output is correct
5 Correct 11 ms 1476 KB Output is correct
6 Correct 11 ms 1480 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 1500 KB Output is correct
2 Correct 12 ms 1340 KB Output is correct
3 Correct 12 ms 1328 KB Output is correct
4 Correct 12 ms 1472 KB Output is correct
5 Correct 11 ms 1476 KB Output is correct
6 Correct 11 ms 1480 KB Output is correct
7 Correct 13 ms 1596 KB Output is correct
8 Correct 12 ms 1468 KB Output is correct
9 Correct 12 ms 1456 KB Output is correct
10 Correct 12 ms 1456 KB Output is correct
11 Correct 12 ms 1468 KB Output is correct
12 Correct 12 ms 1480 KB Output is correct
13 Correct 11 ms 1336 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 1344 KB Output is correct
2 Correct 12 ms 1456 KB Output is correct
3 Correct 12 ms 1492 KB Output is correct
4 Correct 12 ms 1500 KB Output is correct
5 Correct 12 ms 1468 KB Output is correct
6 Correct 12 ms 1456 KB Output is correct
7 Correct 11 ms 1504 KB Output is correct
8 Correct 11 ms 1500 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 1496 KB Output is correct
2 Correct 11 ms 1328 KB Output is correct
3 Correct 13 ms 1456 KB Output is correct
4 Correct 13 ms 1640 KB Output is correct
5 Correct 13 ms 1328 KB Output is correct
6 Correct 12 ms 1460 KB Output is correct

Subtask #5
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 1500 KB Output is correct
2 Correct 12 ms 1340 KB Output is correct
3 Correct 12 ms 1328 KB Output is correct
4 Correct 12 ms 1472 KB Output is correct
5 Correct 11 ms 1476 KB Output is correct
6 Correct 11 ms 1480 KB Output is correct
7 Correct 13 ms 1596 KB Output is correct
8 Correct 12 ms 1468 KB Output is correct
9 Correct 12 ms 1456 KB Output is correct
10 Correct 12 ms 1456 KB Output is correct
11 Correct 12 ms 1468 KB Output is correct
12 Correct 12 ms 1480 KB Output is correct
13 Correct 11 ms 1336 KB Output is correct
14 Correct 12 ms 1456 KB Output is correct
15 Correct 12 ms 1476 KB Output is correct
16 Correct 13 ms 1456 KB Output is correct
17 Correct 12 ms 1456 KB Output is correct
18 Correct 12 ms 1328 KB Output is correct
19 Correct 12 ms 1464 KB Output is correct
20 Correct 12 ms 1328 KB Output is correct
21 Correct 12 ms 1480 KB Output is correct
22 Correct 11 ms 1328 KB Output is correct
23 Correct 11 ms 1500 KB Output is correct
24 Correct 11 ms 1504 KB Output is correct
25 Correct 11 ms 1508 KB Output is correct