| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 881349 |
2023-12-01T07:29:04 Z |
noompty |
Pipes (BOI13_pipes) |
C++17 |
|
1 ms |
600 KB |
#include <iostream>
#include <vector>
#include <tuple>
#include <queue>
#include <stack>
#include <deque>
#include <set>
#include <map>
#include <cmath>
#include <array>
#include <random>
#include <string>
#include <cassert>
#include <climits>
#include <algorithm>
#include <unordered_set>
#include <unordered_map>
using namespace std;
#define ll long long
#define f first
#define s second
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
template<typename A> void __print(const A &x);
template<typename A, typename B> void __print(const pair<A, B> &p);
template<typename... A> void __print(const tuple<A...> &t);
template<typename T> void __print(stack<T> s);
template<typename T> void __print(queue<T> q);
template<typename T, typename... U> void __print(priority_queue<T, U...> q);
template<typename A> void __print(const A &x) {
bool first = true;
cerr << '{';
for (const auto &i : x) {
cerr << (first ? "" : ","), __print(i);
first = false;
}
cerr << '}';
}
template<typename A, typename B> void __print(const pair<A, B> &p) {
cerr << '(';
__print(p.f);
cerr << ',';
__print(p.s);
cerr << ')';
}
template<typename... A> void __print(const tuple<A...> &t) {
bool first = true;
cerr << '(';
apply([&first] (const auto &...args) { ((cerr << (first ? "" : ","), __print(args), first = false), ...); }, t);
cerr << ')';
}
template<typename T> void __print(stack<T> s) {
vector<T> debugVector;
while (!s.empty()) {
T t = s.top();
debugVector.push_back(t);
s.pop();
}
reverse(debugVector.begin(), debugVector.end());
__print(debugVector);
}
template<typename T> void __print(queue<T> q) {
vector<T> debugVector;
while (!q.empty()) {
T t = q.front();
debugVector.push_back(t);
q.pop();
}
__print(debugVector);
}
template<typename T, typename... U> void __print(priority_queue<T, U...> q) {
vector<T> debugVector;
while (!q.empty()) {
T t = q.top();
debugVector.push_back(t);
q.pop();
}
__print(debugVector);
}
void _print() { cerr << "]\n"; }
template <typename Head, typename... Tail> void _print(const Head &H, const Tail &...T) {
__print(H);
if (sizeof...(T)) cerr << ", ";
_print(T...);
}
#ifdef DEBUG
#define D(...) cerr << "Line: " << __LINE__ << " [" << #__VA_ARGS__ << "] = ["; _print(__VA_ARGS__)
#else
#define D(...)
#endif
int n, m;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> n >> m;
if (m > n) {
cout << "0\n";
}
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
| 2 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 3 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 4 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 5 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 6 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 7 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 8 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 9 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 10 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 11 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 12 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 13 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 14 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 15 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 16 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 17 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 18 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
| 19 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 20 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 21 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 22 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 23 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
| 24 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
| 25 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 2 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 3 |
Incorrect |
0 ms |
464 KB |
Output isn't correct |
| 4 |
Correct |
0 ms |
348 KB |
Output is correct |
| 5 |
Correct |
0 ms |
348 KB |
Output is correct |
| 6 |
Correct |
0 ms |
348 KB |
Output is correct |
| 7 |
Incorrect |
0 ms |
600 KB |
Output isn't correct |
| 8 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 9 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 10 |
Correct |
0 ms |
348 KB |
Output is correct |
| 11 |
Correct |
1 ms |
348 KB |
Output is correct |
| 12 |
Correct |
1 ms |
348 KB |
Output is correct |
| 13 |
Correct |
0 ms |
348 KB |
Output is correct |
| 14 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 15 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
| 16 |
Incorrect |
0 ms |
352 KB |
Output isn't correct |
| 17 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 18 |
Correct |
0 ms |
348 KB |
Output is correct |
| 19 |
Correct |
0 ms |
464 KB |
Output is correct |
| 20 |
Correct |
0 ms |
348 KB |
Output is correct |
| 21 |
Correct |
0 ms |
360 KB |
Output is correct |
| 22 |
Incorrect |
0 ms |
360 KB |
Output isn't correct |
| 23 |
Incorrect |
0 ms |
360 KB |
Output isn't correct |
| 24 |
Incorrect |
0 ms |
360 KB |
Output isn't correct |
| 25 |
Incorrect |
0 ms |
360 KB |
Output isn't correct |
| 26 |
Correct |
0 ms |
360 KB |
Output is correct |
| 27 |
Correct |
0 ms |
360 KB |
Output is correct |
| 28 |
Correct |
0 ms |
480 KB |
Output is correct |
| 29 |
Correct |
0 ms |
360 KB |
Output is correct |
| 30 |
Incorrect |
0 ms |
360 KB |
Output isn't correct |
| 31 |
Incorrect |
0 ms |
360 KB |
Output isn't correct |
| 32 |
Incorrect |
0 ms |
356 KB |
Output isn't correct |
| 33 |
Incorrect |
0 ms |
360 KB |
Output isn't correct |
| 34 |
Correct |
0 ms |
356 KB |
Output is correct |
| 35 |
Correct |
0 ms |
360 KB |
Output is correct |
| 36 |
Correct |
1 ms |
360 KB |
Output is correct |
| 37 |
Correct |
1 ms |
556 KB |
Output is correct |
| 38 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 39 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 40 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 41 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 42 |
Correct |
1 ms |
348 KB |
Output is correct |
| 43 |
Correct |
1 ms |
344 KB |
Output is correct |
| 44 |
Correct |
0 ms |
600 KB |
Output is correct |
| 45 |
Correct |
0 ms |
348 KB |
Output is correct |
| 46 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 47 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 48 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 49 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 50 |
Correct |
0 ms |
348 KB |
Output is correct |
| 51 |
Correct |
0 ms |
348 KB |
Output is correct |
| 52 |
Correct |
1 ms |
348 KB |
Output is correct |
| 53 |
Correct |
0 ms |
348 KB |
Output is correct |
| 54 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
