oj.uz

답안 #124633

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
124633 2019-07-03T15:48:09 Z deinfreund CATS (NOI14_cats) C++14
4 / 25
 1500 ms 131972 KB 
#include <bits/stdc++.h>

using namespace std;

bool reversed[2];
vector<int> stacks[2];

void push(int s, int v){
  s--;
  if (v < 0){
    reversed[s] = !reversed[s];
    cout << "alarm" << 0/0 << endl;
  }else{
    //cout << "pushing " << v << endl;
    stacks[s].push_back(v ^ reversed[s]);
  }
}
int peek(int s){
  s--;
  if (stacks[s].empty()) return reversed[s];
  return stacks[s][stacks[s].size() - 1] ^ reversed[s];
}
int pop(int s){
  int v = peek(s);
  s--;
  if (stacks[s].empty()) return reversed[s];
  stacks[s].pop_back();
  return v;
}


int calc(int X, int L, int N){
  stacks[0].clear(); 
  stacks[1].clear(); 
  reversed[0] = 0;
  reversed[1] = 0;
  int COUNTER = X;
  while (COUNTER > 0){
    push(2, peek(1));            //Push the top element of S1 onto S2
    pop(1);                //Pop the top element of S1
    reversed[0] = !reversed[0];
    if (peek(2) > L){
      COUNTER = COUNTER - 1;
      if( COUNTER == 0) {
	return peek(2);
      }
    }
    else{
      //cout << stacks[1].size() << endl;
      push(2, N);
      push(2, N);
      push(2, pop(2) + pop(2));
      push(2, pop(2) + pop(2));
      push(1, peek(2));
      push(1, peek(2));
      pop(2);
      pop(2);
      
      //cout << stacks[1].size() << endl;
    }
  }
}

int calc2(int X, int L, int N){
  
}

int main(){
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int Q;
  
  cin >> Q;
  for (int q = 0; q< Q; q++){
    int x,l,n;
    cin >>x >>l>> n;
    cout << calc(x,l,n) << endl;
  }
  
}

Compilation message

cats.cpp: In function 'void push(int, int)':
cats.cpp:12:25: warning: division by zero [-Wdiv-by-zero]
     cout << "alarm" << 0/0 << endl;
                        ~^~
cats.cpp: In function 'int calc2(int, int, int)':
cats.cpp:66:1: warning: no return statement in function returning non-void [-Wreturn-type]
 }
 ^
cats.cpp: In function 'int calc(int, int, int)':
cats.cpp:62:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 45 ms 512 KB Output is correct
2 Correct 33 ms 2540 KB Output is correct
3 Correct 33 ms 1524 KB Output is correct
4 Correct 25 ms 1016 KB Output is correct
5 Correct 27 ms 2580 KB Output is correct

Subtask #2
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1553 ms 2548 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1563 ms 2544 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1573 ms 1600 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1581 ms 131860 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1575 ms 131972 KB Time limit exceeded
2 Halted 0 ms 0 KB -