oj.uz

답안 #707269

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
707269 2023-03-08T17:45:34 Z NemanjaSo2005 버섯 세기 (IOI20_mushrooms) C++14
80.427 / 100
 9 ms 592 KB 
#include "mushrooms.h"
#include<bits/stdc++.h>
#define ll long long
using namespace std;
ll N,sta[20005],D=139;
bool inv;
vector<int> x,A,B,R;
stack<int> S;
int count_mushrooms(int n){
   N=n;
   if(N<=227){
      sta[0]=1;
      for(int i=0;i+1<N;i++){
         x.clear();
         x.push_back(i);
         x.push_back(i+1);
         sta[i+1]=sta[i]^use_machine(x);
      }
      ll res=0;
      for(int i=0;i<N;i++)
         res+=sta[i];
      return res;
   }
   ll res=1;
   for(int i=0;i<N;i++)
      sta[i]=2;
   sta[0]=1;
   A.push_back(0);
   for(int i=0;i+1<N;i++){
      if(A.size()>=D or B.size()>=D)
         break;
      //cout<<i<<endl;
      if((A.size()<2 and B.size()<2) or (i+2==N)){
         x.clear();
         x.push_back(i);
         x.push_back(i+1);
         sta[i+1]=sta[i]^use_machine(x);
          if(sta[i+1]==1){
            A.push_back(i+1);
            res++;
         }
         else
            B.push_back(i+1);
        // cout<<"DODAJEM "<<i+1<<endl;
      }
      else{
         if(A.size()>=2){
            x.clear();
            x.push_back(A[0]);
            x.push_back(i+1);
            x.push_back(A[1]);
            x.push_back(i+2);
            int r=use_machine(x);
            if(r>=2)
               sta[i+1]=0;
            else
               sta[i+1]=1;
            if(r%2==1)
               sta[i+2]=0;
            else
               sta[i+2]=1;
         }
         else{
            x.clear();
            x.push_back(B[0]);
            x.push_back(i+1);
            x.push_back(B[1]);
            x.push_back(i+2);
            int r=use_machine(x);
            if(r>=2)
               sta[i+1]=1;
            else
               sta[i+1]=0;
            if(r%2==1)
               sta[i+2]=1;
            else
               sta[i+2]=0;
         }
         if(sta[i+1]==1){
            A.push_back(i+1);
            res++;
         }
         else
            B.push_back(i+1);
 
         if(sta[i+2]==1){
            A.push_back(i+2);
            res++;
         }
         else
            B.push_back(i+2);
        // cout<<"DODAJEM "<<i+1<<endl;
       //  cout<<"DODAJEM "<<i+2<<endl;
         i++;
      }
   }
   if(A.size()>B.size()){
      R=A;
      inv=1;
   }
   else{
      R=B;
      inv=0;
   }
   for(int i=0;i<N;i++)
      if(sta[i]==2)
         S.push(i);
   int pok;
  // cout<<res<<endl;
   while(S.size()){
      x.clear();
      x.push_back(R[0]);
      pok=1;
      while(pok<R.size() and S.size()){
         x.push_back(S.top());
         S.pop();
         x.push_back(R[pok]);
         pok++;
      }
      bool dod=false;
      if(S.size()){
         dod=true;
         x.push_back(S.top());
         S.pop();
      }
      int r=use_machine(x);
      if(inv){
         res+=((x.size()-1)-r)/2;
         if(r%2==0 and dod)
            res++;
      }
      else{
         res+=(r)/2;
         if(r%2==1 and dod)
            res++;
      }
      //cout<<res<<endl;
   }
   return res;
}

Compilation message

mushrooms.cpp: In function 'int count_mushrooms(int)':
mushrooms.cpp:30:18: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
   30 |       if(A.size()>=D or B.size()>=D)
      |          ~~~~~~~~^~~
mushrooms.cpp:30:33: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
   30 |       if(A.size()>=D or B.size()>=D)
      |                         ~~~~~~~~^~~
mushrooms.cpp:114:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  114 |       while(pok<R.size() and S.size()){
      |             ~~~^~~~~~~~~

Subtask #1
80.427 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 2 ms 208 KB Output is correct
6 Correct 2 ms 332 KB Output is correct
7 Correct 6 ms 464 KB Output is correct
8 Correct 6 ms 464 KB Output is correct
9 Correct 7 ms 464 KB Output is correct
10 Partially correct 6 ms 464 KB Output is partially correct
11 Partially correct 6 ms 464 KB Output is partially correct
12 Partially correct 7 ms 472 KB Output is partially correct
13 Correct 7 ms 464 KB Output is correct
14 Correct 4 ms 336 KB Output is correct
15 Partially correct 8 ms 464 KB Output is partially correct
16 Partially correct 6 ms 464 KB Output is partially correct
17 Correct 5 ms 336 KB Output is correct
18 Correct 7 ms 464 KB Output is correct
19 Partially correct 9 ms 464 KB Output is partially correct
20 Partially correct 8 ms 464 KB Output is partially correct
21 Partially correct 6 ms 464 KB Output is partially correct
22 Partially correct 7 ms 464 KB Output is partially correct
23 Partially correct 6 ms 464 KB Output is partially correct
24 Correct 5 ms 396 KB Output is correct
25 Partially correct 7 ms 464 KB Output is partially correct
26 Partially correct 6 ms 464 KB Output is partially correct
27 Partially correct 9 ms 464 KB Output is partially correct
28 Partially correct 7 ms 464 KB Output is partially correct
29 Partially correct 6 ms 464 KB Output is partially correct
30 Partially correct 6 ms 464 KB Output is partially correct
31 Partially correct 7 ms 464 KB Output is partially correct
32 Partially correct 9 ms 464 KB Output is partially correct
33 Partially correct 7 ms 464 KB Output is partially correct
34 Partially correct 7 ms 464 KB Output is partially correct
35 Partially correct 9 ms 464 KB Output is partially correct
36 Partially correct 6 ms 464 KB Output is partially correct
37 Partially correct 8 ms 464 KB Output is partially correct
38 Partially correct 7 ms 464 KB Output is partially correct
39 Partially correct 9 ms 464 KB Output is partially correct
40 Partially correct 7 ms 464 KB Output is partially correct
41 Partially correct 6 ms 464 KB Output is partially correct
42 Partially correct 9 ms 464 KB Output is partially correct
43 Partially correct 7 ms 464 KB Output is partially correct
44 Partially correct 9 ms 464 KB Output is partially correct
45 Partially correct 6 ms 464 KB Output is partially correct
46 Partially correct 7 ms 464 KB Output is partially correct
47 Partially correct 7 ms 464 KB Output is partially correct
48 Partially correct 6 ms 464 KB Output is partially correct
49 Partially correct 6 ms 464 KB Output is partially correct
50 Partially correct 7 ms 464 KB Output is partially correct
51 Partially correct 7 ms 464 KB Output is partially correct
52 Partially correct 6 ms 464 KB Output is partially correct
53 Partially correct 9 ms 464 KB Output is partially correct
54 Partially correct 6 ms 464 KB Output is partially correct
55 Partially correct 6 ms 472 KB Output is partially correct
56 Partially correct 6 ms 464 KB Output is partially correct
57 Partially correct 7 ms 464 KB Output is partially correct
58 Partially correct 9 ms 592 KB Output is partially correct
59 Partially correct 8 ms 464 KB Output is partially correct
60 Partially correct 6 ms 464 KB Output is partially correct
61 Partially correct 6 ms 468 KB Output is partially correct
62 Correct 0 ms 220 KB Output is correct
63 Correct 0 ms 208 KB Output is correct
64 Correct 1 ms 208 KB Output is correct
65 Correct 0 ms 208 KB Output is correct
66 Correct 0 ms 208 KB Output is correct
67 Correct 0 ms 208 KB Output is correct
68 Correct 1 ms 208 KB Output is correct
69 Correct 0 ms 208 KB Output is correct
70 Correct 0 ms 208 KB Output is correct
71 Correct 0 ms 208 KB Output is correct
72 Correct 0 ms 208 KB Output is correct
73 Correct 0 ms 208 KB Output is correct
74 Correct 0 ms 208 KB Output is correct
75 Correct 1 ms 208 KB Output is correct
76 Correct 0 ms 208 KB Output is correct
77 Correct 0 ms 208 KB Output is correct
78 Correct 0 ms 208 KB Output is correct
79 Correct 0 ms 208 KB Output is correct
80 Correct 0 ms 208 KB Output is correct
81 Correct 1 ms 208 KB Output is correct
82 Correct 1 ms 208 KB Output is correct
83 Correct 1 ms 208 KB Output is correct
84 Correct 1 ms 208 KB Output is correct
85 Correct 1 ms 208 KB Output is correct
86 Correct 0 ms 208 KB Output is correct
87 Correct 0 ms 208 KB Output is correct
88 Correct 0 ms 208 KB Output is correct
89 Correct 0 ms 208 KB Output is correct
90 Correct 1 ms 208 KB Output is correct
91 Correct 1 ms 208 KB Output is correct