CSES - Datatähti 2017 alku - Results
Submission details
Task:Kolikot
Sender:ankka22
Submission time:2016-10-16 16:26:53 +0300
Language:C++
Status:READY
Result:57
Feedback
groupverdictscore
#1ACCEPTED22
#2ACCEPTED35
#30
Test results
testverdicttimegroup
#1ACCEPTED0.06 s1details
#2ACCEPTED0.05 s1details
#3ACCEPTED0.07 s1details
#4ACCEPTED0.06 s1details
#5ACCEPTED0.05 s1details
#6ACCEPTED0.06 s2details
#7ACCEPTED0.05 s2details
#8ACCEPTED0.05 s2details
#9ACCEPTED0.05 s2details
#10ACCEPTED0.28 s2details
#11--3details
#12ACCEPTED0.07 s3details
#13ACCEPTED0.09 s3details
#14--3details
#15--3details
#16--3details

Compiler report

input/code.cpp:81:3: warning: "/*" within comment [-Wcomment]
   /*for (int i = 0; i < n; i++) {
 ^
input/code.cpp: In function 'bool jei(int, std::vector<int>)':
input/code.cpp:10:38: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < koliket.size(); i++) {
                                      ^
input/code.cpp:19:40: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
       } else if (i == koliket.size() - 1) {
                                        ^

Code

#include <iostream>
#include <math.h>
#include <algorithm>

bool mf (int i,int j) { return (i<j);}
bool mf2 (int i,int j) { return (i>j);}

bool jei(int n, std::vector<int> koliket) {
  while (n > 0 && koliket.size() > 0) {
    for (int i = 0; i < koliket.size(); i++) {
      if (koliket.at(0) > n) {
        n -= koliket.at(0);
        koliket.erase(koliket.begin());
        break;
      } else if (koliket.at(i) > n) {
        n -= koliket.at(i - 1);
        koliket.erase(koliket.begin() + i - 1);
        break;
      } else if (i == koliket.size() - 1) {
        n -= koliket.at(koliket.size() - 1);
        koliket.erase(koliket.begin() + koliket.size() - 1);
      }
    }
    //std::cout << koliket.size() << std::endl;
  }
  if (n == 0) {
    //std::cout << og << " voidaan muodostaa" << std::endl;
    return true;
  } else {
    //std::cout << og << " ei voida muodostaa" << std::endl;
    return false;
  //  std::cout << n << std::endl;
  }

}
int main() {
	int n;
	std::vector<int> v;
  std::vector<int> s;
  std::vector<int> s2;
  std::vector<int> sr;
	std::cin >> n;
  if (n == -1) {
    v = {2,2,5,8};
    n = 4;
  } else if (n == -2) {
    v = {1,1,1,2,2,3,5,8,6,7,20};
    n = 11;
  } else {
    for (int i = 0; i < n; i++) {
      int t;
      std::cin >> t;
      v.push_back(t);
    }
  }
  std::sort(std::begin(v), std::end(v));
  s.push_back(v.at(0));
  sr.push_back(v.at(n-1));
  s2.push_back(v.at(n - 1));
  for (int i = 0; i < n; i++) {
  //  std::cout << v.at(i) << " ";
  //  if (v.at(i) < 10) {
  //    std::cout << " ";
  //  }
    if (i != 0) {
      s.push_back(s.at(i - 1) + v.at(i));
    }
    if (i != 0) {
      sr.push_back(sr.at(i - 1) + v.at(n - i - 1));
    }
  }
  for (int i = 0; i < n; i++) {
    s2.push_back(v.at(n - 1) - v.at(i));
  }
  std::reverse(sr.begin(), sr.end());
/*  std::cout << std::endl;
  for (int i = 0; i < n; i++) {
    std::cout << sr.at(i) << " ";
  }
  std::cout << std::endl;
  /*for (int i = 0; i < n; i++) {
    std::cout << s.at(i) << " ";
    if (s.at(i) < 10) {
      std::cout << " ";
    }
  }*/
  for (int i = 1; i < 10e6 + 1; i++) {
    if(std::binary_search (v.begin(), v.end(), i, mf) ||
       std::binary_search (sr.begin(), sr.end(), i, mf2)) {
      continue;
    }
    if (jei(i, v)) {
      continue;
    }
    std::cout << i <<  std::endl;
    break;
  }
  //int cmax = s.at(n - 1);
  //std::cout << std::endl;
	return 0;
}


/*
Syöte:
4
2 1 2 7

Tuloste:
6

*/

Test details

Test 1

Group: 1

Verdict: ACCEPTED

input
10
5 3 1 4 5 1 3 2 2 3

correct output
30

user output
30

Test 2

Group: 1

Verdict: ACCEPTED

input
10
3 5 5 4 5 4 5 5 5 3

correct output
1

user output
1

Test 3

Group: 1

Verdict: ACCEPTED

input
10
10 9 2 8 7 10 7 1 5 2

correct output
62

user output
62

Test 4

Group: 1

Verdict: ACCEPTED

input
10
7 4 6 3 9 7 4 4 7 7

correct output
1

user output
1

Test 5

Group: 1

Verdict: ACCEPTED

input
10
8 2 1 7 9 7 5 2 4 5

correct output
51

user output
51

Test 6

Group: 2

Verdict: ACCEPTED

input
100
3 3 1 4 2 1 2 1 3 1 2 5 1 5 1 ...

correct output
269

user output
269

Test 7

Group: 2

Verdict: ACCEPTED

input
100
3 3 2 3 4 5 4 4 4 4 2 2 4 4 4 ...

correct output
1

user output
1

Test 8

Group: 2

Verdict: ACCEPTED

input
100
678 999 374 759 437 390 832 54...

correct output
1

user output
1

Test 9

Group: 2

Verdict: ACCEPTED

input
100
862 537 633 807 666 248 237 5 ...

correct output
30

user output
30

Test 10

Group: 2

Verdict: ACCEPTED

input
100
874 302 384 920 76 28 762 163 ...

correct output
41765

user output
41765

Test 11

Group: 3

Verdict:

input
100000
4 2 5 3 2 3 5 2 2 2 3 4 3 3 2 ...

correct output
299640

user output
(empty)

Test 12

Group: 3

Verdict: ACCEPTED

input
100000
2 5 5 5 5 2 4 4 3 2 3 2 5 5 3 ...

correct output
1

user output
1

Test 13

Group: 3

Verdict: ACCEPTED

input
100000
98146842 766872135 84108268 28...

correct output
1

user output
1

Test 14

Group: 3

Verdict:

input
100000
932032495 1 849176169 78948957...

correct output
29970

user output
(empty)

Test 15

Group: 3

Verdict:

input
100000
35894853 796619259 699878597 4...

correct output
44965249639582

user output
(empty)

Test 16

Group: 3

Verdict:

input
100000
930494676 960662779 904422858 ...

correct output
800020001

user output
(empty)