problem_id
stringlengths 6
6
| language
stringclasses 2
values | original_status
stringclasses 3
values | original_src
stringlengths 19
243k
| changed_src
stringlengths 19
243k
| change
stringclasses 3
values | i1
int64 0
8.44k
| i2
int64 0
8.44k
| j1
int64 0
8.44k
| j2
int64 0
8.44k
| error
stringclasses 270
values | stderr
stringlengths 0
226k
|
|---|---|---|---|---|---|---|---|---|---|---|---|
p02265
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int main() {
list<int> l;
int n;
cin >> n;
for (int i = 0; i < n; i++) {
string comm;
int x;
cin >> comm;
if (comm == "insert") {
cin >> x;
l.push_front(x);
} else if (comm == "delete") {
cin >> x;
for (auto it = l.begin(); it != l.end(); it++) {
if (*it == x) {
l.erase(it);
break;
}
}
} else if (comm == "deleteFirst") {
l.pop_front();
} else {
l.pop_back();
}
}
for (auto it = l.begin(); it != l.end(); it++) {
if (it != l.begin())
cout << ' ';
cout << *it;
}
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
list<int> l;
int n;
cin >> n;
for (int i = 0; i < n; i++) {
string comm;
int x;
cin >> comm;
if (comm == "insert") {
cin >> x;
l.push_front(x);
} else if (comm == "delete") {
cin >> x;
for (auto it = l.begin(); it != l.end(); it++) {
if (*it == x) {
l.erase(it);
break;
}
}
} else if (comm == "deleteFirst") {
l.pop_front();
} else {
l.pop_back();
}
}
for (auto it = l.begin(); it != l.end(); it++) {
if (it != l.begin())
cout << ' ';
cout << *it;
}
cout << endl;
return 0;
}
|
insert
| 7 | 7 | 7 | 10 |
TLE
| |
p02265
|
C++
|
Runtime Error
|
#include <iostream>
#include <string>
using namespace std;
class Linked_list {
struct Item {
int num;
Item *next;
Item *prev;
};
Item *first, *last;
public:
Linked_list() {
first = NULL;
last = NULL;
}
void insert(int x) {
Item *item = new Item();
item->num = x;
item->prev = NULL;
item->next = first;
if (item->next != NULL)
item->next->prev = item;
first = item;
if (last == NULL)
last = item;
}
void delete_item(int x) {
Item *item = first;
while (item != NULL) {
if (item->num == x) {
if (item->prev != NULL) {
item->prev->next = item->next;
} else {
first = item->next;
}
if (item->next != NULL) {
item->next->prev = item->prev;
} else {
last = item->prev;
}
delete item;
return;
}
item = item->next;
}
}
void delete_first() {
Item *item = first;
if (first->next == NULL)
last = NULL;
first = item->next;
delete item;
first->prev = NULL;
}
void delete_last() {
Item *item = last;
if (last->prev == NULL)
first = NULL;
last = item->prev;
if (last != NULL)
last->next = NULL;
delete item;
}
int pop_first() {
Item *item = first;
first = item->next;
return item->num;
}
bool is_empty() { return first == NULL; }
};
int main() {
ios::sync_with_stdio(false);
Linked_list list;
int n;
string ope;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> ope;
if (ope == "insert") {
int x;
cin >> x;
list.insert(x);
} else if (ope == "delete") {
int x;
cin >> x;
list.delete_item(x);
} else if (ope == "deleteFirst") {
list.delete_first();
} else if (ope == "deleteLast") {
list.delete_last();
}
}
int count = 0;
while (!list.is_empty()) {
if (count)
cout << " ";
cout << list.pop_first();
count++;
}
cout << endl;
}
|
#include <iostream>
#include <string>
using namespace std;
class Linked_list {
struct Item {
int num;
Item *next;
Item *prev;
};
Item *first, *last;
public:
Linked_list() {
first = NULL;
last = NULL;
}
void insert(int x) {
Item *item = new Item();
item->num = x;
item->prev = NULL;
item->next = first;
if (item->next != NULL)
item->next->prev = item;
first = item;
if (last == NULL)
last = item;
}
void delete_item(int x) {
Item *item = first;
while (item != NULL) {
if (item->num == x) {
if (item->prev != NULL) {
item->prev->next = item->next;
} else {
first = item->next;
}
if (item->next != NULL) {
item->next->prev = item->prev;
} else {
last = item->prev;
}
delete item;
return;
}
item = item->next;
}
}
void delete_first() {
Item *item = first;
if (first->next == NULL)
last = NULL;
first = item->next;
delete item;
if (first != NULL)
first->prev = NULL;
}
void delete_last() {
Item *item = last;
if (last->prev == NULL)
first = NULL;
last = item->prev;
if (last != NULL)
last->next = NULL;
delete item;
}
int pop_first() {
Item *item = first;
first = item->next;
return item->num;
}
bool is_empty() { return first == NULL; }
};
int main() {
ios::sync_with_stdio(false);
Linked_list list;
int n;
string ope;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> ope;
if (ope == "insert") {
int x;
cin >> x;
list.insert(x);
} else if (ope == "delete") {
int x;
cin >> x;
list.delete_item(x);
} else if (ope == "deleteFirst") {
list.delete_first();
} else if (ope == "deleteLast") {
list.delete_last();
}
}
int count = 0;
while (!list.is_empty()) {
if (count)
cout << " ";
cout << list.pop_first();
count++;
}
cout << endl;
}
|
replace
| 59 | 60 | 59 | 61 |
0
| |
p02265
|
C++
|
Time Limit Exceeded
|
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define all(c) (c).begin(), (c).end()
#define rep(i, n) for (int i = 0; i < (n); i++)
#define pb(e) push_back(e)
#define mp(a, b) make_pair(a, b)
#define fr first
#define sc second
const int INF = 100000000;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
struct Node {
int value;
Node *next;
Node *prev;
};
Node *nil;
void init() {
nil = new Node();
nil->next = nil;
nil->prev = nil;
}
void insert_node(int x) {
Node *p = new Node;
p->value = x;
p->next = nil->next;
nil->next->prev = p;
nil->next = p;
p->prev = nil;
}
Node *search_node(int x) {
Node *cur = nil->next;
while (cur != nil && cur->value != x)
cur = cur->next;
return cur;
}
void delete_node(Node *p) {
if (p == nil)
return;
p->prev->next = p->next;
p->next->prev = p->prev;
delete p;
}
void delete_first_node() { delete_node(nil->next); }
void delete_last_node() { delete_node(nil->prev); }
void delete_key_node(int x) { delete_node(search_node(x)); }
int main() {
init();
int n;
string q;
cin >> n;
while (n--) {
int x;
cin >> q;
if (q == "insert") {
cin >> x;
insert_node(x);
} else if (q == "delete") {
cin >> x;
delete_key_node(x);
} else if (q == "deleteFirst") {
delete_first_node();
} else if (q == "deleteLast") {
delete_last_node();
}
}
int t = 0;
Node *cur = nil->next;
while (cur != nil) {
if (t++)
cout << " ";
cout << cur->value;
cur = cur->next;
}
cout << endl;
return 0;
}
|
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define all(c) (c).begin(), (c).end()
#define rep(i, n) for (int i = 0; i < (n); i++)
#define pb(e) push_back(e)
#define mp(a, b) make_pair(a, b)
#define fr first
#define sc second
const int INF = 100000000;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
struct Node {
int value;
Node *next;
Node *prev;
};
Node *nil;
void init() {
nil = new Node();
nil->next = nil;
nil->prev = nil;
}
void insert_node(int x) {
Node *p = new Node;
p->value = x;
p->next = nil->next;
nil->next->prev = p;
nil->next = p;
p->prev = nil;
}
Node *search_node(int x) {
Node *cur = nil->next;
while (cur != nil && cur->value != x)
cur = cur->next;
return cur;
}
void delete_node(Node *p) {
if (p == nil)
return;
p->prev->next = p->next;
p->next->prev = p->prev;
delete p;
}
void delete_first_node() { delete_node(nil->next); }
void delete_last_node() { delete_node(nil->prev); }
void delete_key_node(int x) { delete_node(search_node(x)); }
int main() {
ios::sync_with_stdio(false);
init();
int n;
string q;
cin >> n;
while (n--) {
int x;
cin >> q;
if (q == "insert") {
cin >> x;
insert_node(x);
} else if (q == "delete") {
cin >> x;
delete_key_node(x);
} else if (q == "deleteFirst") {
delete_first_node();
} else if (q == "deleteLast") {
delete_last_node();
}
}
int t = 0;
Node *cur = nil->next;
while (cur != nil) {
if (t++)
cout << " ";
cout << cur->value;
cur = cur->next;
}
cout << endl;
return 0;
}
|
insert
| 75 | 75 | 75 | 76 |
TLE
| |
p02265
|
C++
|
Time Limit Exceeded
|
///
// File: alds1_3_c.cpp
// Author: ymiyamoto
//
// Created on Sat Oct 7 15:06:49 2017
//
#include <cstdint>
#include <cstring>
#include <iostream>
using namespace std;
struct linked_list_t {
linked_list_t *prev;
linked_list_t *next;
int64_t val;
};
static void delete_list(linked_list_t *list) {
linked_list_t *prev = list->prev;
linked_list_t *next = list->next;
prev->next = next;
next->prev = prev;
delete list;
}
int32_t main() {
uint64_t n;
cin >> n;
linked_list_t list;
list.prev = &list;
list.next = &list;
list.val = -1;
for (uint64_t i = 0; i < n; i++) {
char str[20];
scanf("%s", str);
if (str[0] == 'i') {
int64_t val;
scanf("%lld", &val);
linked_list_t *new_list = new linked_list_t;
linked_list_t *next = list.next;
linked_list_t *prev = &list;
next->prev = new_list;
prev->next = new_list;
new_list->val = val;
new_list->next = next;
new_list->prev = prev;
} else if (str[0] == 'd') {
if (strlen(str) == 6) {
int64_t val;
scanf("%lld", &val);
linked_list_t *l = list.next;
while (true) {
if (l->val == val) {
delete_list(l);
break;
}
l = l->next;
}
} else if (str[6] == 'F') {
delete_list(list.next);
} else {
delete_list(list.prev);
}
}
}
linked_list_t *l = list.next;
while (l->val != -1) {
if (l != list.next)
cout << " ";
cout << l->val;
l = l->next;
}
cout << endl;
return 0;
}
|
///
// File: alds1_3_c.cpp
// Author: ymiyamoto
//
// Created on Sat Oct 7 15:06:49 2017
//
#include <cstdint>
#include <cstring>
#include <iostream>
using namespace std;
struct linked_list_t {
linked_list_t *prev;
linked_list_t *next;
int64_t val;
};
static void delete_list(linked_list_t *list) {
linked_list_t *prev = list->prev;
linked_list_t *next = list->next;
prev->next = next;
next->prev = prev;
delete list;
}
int32_t main() {
uint64_t n;
cin >> n;
linked_list_t list;
list.prev = &list;
list.next = &list;
list.val = -1;
for (uint64_t i = 0; i < n; i++) {
char str[20];
scanf("%s", str);
if (str[0] == 'i') {
int64_t val;
scanf("%lld", &val);
linked_list_t *new_list = new linked_list_t;
linked_list_t *next = list.next;
linked_list_t *prev = &list;
next->prev = new_list;
prev->next = new_list;
new_list->val = val;
new_list->next = next;
new_list->prev = prev;
} else if (str[0] == 'd') {
if (strlen(str) == 6) {
int64_t val;
scanf("%lld", &val);
linked_list_t *l = list.next;
while (true) {
if (l->val == val) {
delete_list(l);
break;
}
l = l->next;
if (l->val == -1)
break;
}
} else if (str[6] == 'F') {
delete_list(list.next);
} else {
delete_list(list.prev);
}
}
}
linked_list_t *l = list.next;
while (l->val != -1) {
if (l != list.next)
cout << " ";
cout << l->val;
l = l->next;
}
cout << endl;
return 0;
}
|
insert
| 63 | 63 | 63 | 65 |
TLE
| |
p02265
|
C++
|
Time Limit Exceeded
|
#include <cstdio>
#include <cstdlib>
typedef struct Node {
int key;
struct Node *prev;
struct Node *next;
} Node;
Node *head;
void initNode() {
head = (Node *)malloc(sizeof(Node));
head->prev = head;
head->next = head;
}
void insertFirst(int key) {
Node *x = (Node *)malloc(sizeof(Node));
x->key = key;
x->next = head->next;
head->next->prev = x;
x->prev = head;
head->next = x;
}
Node *listSearch(int key) {
Node *current = head->next;
while (current != head && current->key != key) {
current = current->next;
}
return current;
}
void deleteFirst() {
Node *t = head->next;
head->next = t->next;
t->next->prev = head;
free(t);
}
void deleteLast() {
Node *t = head->prev;
head->prev = t->prev;
t->prev->next = head;
free(t);
}
void deleteNode(int key) {
Node *t = listSearch(key);
t->prev->next = t->next;
t->next->prev = t->prev;
free(t);
}
int main() {
initNode();
int n;
scanf("%d", &n);
char com[20];
int x;
for (int i = 0; i < n; i++) {
scanf("%s", com);
if (com[6] == '\0') {
scanf("%d", &x);
if (com[0] == 'i') {
insertFirst(x);
} else if (com[0] == 'd') {
deleteNode(x);
}
} else {
if (com[6] == 'F') {
deleteFirst();
} else if (com[6] == 'L') {
deleteLast();
}
}
}
Node *temp = head->next;
int isf = 0;
while (temp != head) {
if (isf++ > 0)
printf(" ");
printf("%d", temp->key);
temp = temp->next;
}
printf("\n");
return 0;
}
|
#include <cstdio>
#include <cstdlib>
typedef struct Node {
int key;
struct Node *prev;
struct Node *next;
} Node;
Node *head;
void initNode() {
head = (Node *)malloc(sizeof(Node));
head->prev = head;
head->next = head;
}
void insertFirst(int key) {
Node *x = (Node *)malloc(sizeof(Node));
x->key = key;
x->next = head->next;
head->next->prev = x;
x->prev = head;
head->next = x;
}
Node *listSearch(int key) {
Node *current = head->next;
while (current != head && current->key != key) {
current = current->next;
}
return current;
}
void deleteFirst() {
Node *t = head->next;
head->next = t->next;
t->next->prev = head;
free(t);
}
void deleteLast() {
Node *t = head->prev;
head->prev = t->prev;
t->prev->next = head;
free(t);
}
void deleteNode(int key) {
Node *t = listSearch(key);
if (t == head)
return;
t->prev->next = t->next;
t->next->prev = t->prev;
free(t);
}
int main() {
initNode();
int n;
scanf("%d", &n);
char com[20];
int x;
for (int i = 0; i < n; i++) {
scanf("%s", com);
if (com[6] == '\0') {
scanf("%d", &x);
if (com[0] == 'i') {
insertFirst(x);
} else if (com[0] == 'd') {
deleteNode(x);
}
} else {
if (com[6] == 'F') {
deleteFirst();
} else if (com[6] == 'L') {
deleteLast();
}
}
}
Node *temp = head->next;
int isf = 0;
while (temp != head) {
if (isf++ > 0)
printf(" ");
printf("%d", temp->key);
temp = temp->next;
}
printf("\n");
return 0;
}
|
insert
| 49 | 49 | 49 | 51 |
TLE
| |
p02265
|
C++
|
Time Limit Exceeded
|
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
deque<int> d;
int n;
string cmd;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> cmd;
if (cmd == "insert") {
int x;
cin >> x;
d.push_front(x);
} else if (cmd == "delete") {
int x;
cin >> x;
for (deque<int>::iterator i = d.begin(); i != d.end(); i++) {
if (*i == x) {
d.erase(i);
break;
}
}
} else if (cmd == "deleteFirst") {
d.pop_front();
} else {
d.pop_back();
}
}
for (deque<int>::iterator i = d.begin(); i != d.end() - 1; i++) {
cout << *i << " ";
}
cout << d.back() << endl;
return 0;
}
|
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
deque<int> d;
int n;
string cmd;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> cmd;
if (cmd == "insert") {
int x;
cin >> x;
d.push_front(x);
} else if (cmd == "delete") {
int x;
cin >> x;
for (deque<int>::iterator i = d.begin(); i != d.end(); i++) {
if (*i == x) {
d.erase(i);
break;
}
}
} else if (cmd == "deleteFirst") {
d.pop_front();
} else {
d.pop_back();
}
}
for (deque<int>::iterator i = d.begin(); i != d.end() - 1; i++) {
cout << *i << " ";
}
cout << d.back() << endl;
return 0;
}
|
insert
| 15 | 15 | 15 | 18 |
TLE
| |
p02266
|
C++
|
Runtime Error
|
#include <algorithm>
#include <iostream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
stack<int> S1;
stack<pair<int, int>> S2;
char ch;
int sum = 0;
for (int i = 0; cin >> ch; ++i) {
if (ch == '\\')
S1.push(i);
else if (ch == '/' && S1.size() > 0) {
int j = S1.top();
S1.pop();
sum += i - j;
int a = i - j;
while (S2.size() > 0 && S2.top().first > j) {
a += S2.top().second;
S2.pop();
}
S2.push(make_pair(j, a));
}
}
vector<int> ans;
int t = 0;
while (S2.size() > 0) {
ans.push_back(S2.top().second);
S2.top();
}
reverse(ans.begin(), ans.end());
cout << sum << endl;
cout << ans.size();
for (int i = 0; i < ans.size(); i++) {
cout << " ";
t += ans[i];
cout << ans[i];
}
cout << endl;
return 0;
}
|
#include <algorithm>
#include <iostream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
stack<int> S1;
stack<pair<int, int>> S2;
char ch;
int sum = 0;
for (int i = 0; cin >> ch; ++i) {
if (ch == '\\')
S1.push(i);
else if (ch == '/' && S1.size() > 0) {
int j = S1.top();
S1.pop();
sum += i - j;
int a = i - j;
while (S2.size() > 0 && S2.top().first > j) {
a += S2.top().second;
S2.pop();
}
S2.push(make_pair(j, a));
}
}
vector<int> ans;
int t = 0;
while (S2.size() > 0) {
ans.push_back(S2.top().second);
S2.pop();
}
reverse(ans.begin(), ans.end());
cout << sum << endl;
cout << ans.size();
for (int i = 0; i < ans.size(); i++) {
cout << " ";
t += ans[i];
cout << ans[i];
}
cout << endl;
return 0;
}
|
replace
| 32 | 33 | 32 | 33 |
-6
|
terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
p02266
|
C++
|
Runtime Error
|
#include <cstdio>
#include <stack>
using namespace std;
int main() {
int total_area = 0;
stack<int> s1;
stack<pair<int, int>> s2;
char c;
int i = 0;
int ip, area;
for (scanf("%c", &c); c != '\n'; scanf("%c", &c), ++i) {
switch (c) {
case '\\':
s1.push(i);
break;
case '_':
break;
case '/':
ip = s1.top();
s1.pop();
area = i - ip;
total_area += area;
while (s2.empty() == false && s2.top().first > ip) {
area += s2.top().second;
s2.pop();
}
s2.push(make_pair(ip, area));
break;
}
}
int s = s2.size();
int a[s];
for (int i = s - 1; i >= 0; --i) {
a[i] = s2.top().second;
s2.pop();
}
printf("%d\n", total_area);
printf("%d", s);
for (int i = 0; i < s; ++i)
printf(" %d", a[i]);
printf("\n");
return 0;
}
|
#include <cstdio>
#include <stack>
using namespace std;
int main() {
int total_area = 0;
stack<int> s1;
stack<pair<int, int>> s2;
char c;
int i = 0;
int ip, area;
for (scanf("%c", &c); c != '\n'; scanf("%c", &c), ++i) {
switch (c) {
case '\\':
s1.push(i);
break;
case '_':
break;
case '/':
if (s1.empty())
break;
ip = s1.top();
s1.pop();
area = i - ip;
total_area += area;
while (s2.empty() == false && s2.top().first > ip) {
area += s2.top().second;
s2.pop();
}
s2.push(make_pair(ip, area));
break;
}
}
int s = s2.size();
int a[s];
for (int i = s - 1; i >= 0; --i) {
a[i] = s2.top().second;
s2.pop();
}
printf("%d\n", total_area);
printf("%d", s);
for (int i = 0; i < s; ++i)
printf(" %d", a[i]);
printf("\n");
return 0;
}
|
insert
| 21 | 21 | 21 | 23 |
0
| |
p02266
|
C++
|
Runtime Error
|
#include <iostream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
int main(void) {
std::string Input;
std::cin >> Input;
std::stack<int> PlaceBackSlash;
std::stack<std::pair<int, int>> Puddle_Place_Quantity;
for (unsigned int i = 0; i < Input.size(); ++i) {
if (Input[i] == '\\') {
PlaceBackSlash.push(i);
} else if (Input[i] == '/') {
if (!(PlaceBackSlash.empty())) {
//???????????????????????\?????´???
int PlaceFirstBackSlash = PlaceBackSlash.top();
PlaceBackSlash.pop();
int Quantity = 0;
//??????????????\??¨?°´?????????????????????????????\??\???????°´???????¶??????????
while (!(Puddle_Place_Quantity.empty()) &&
Puddle_Place_Quantity.top().first > PlaceFirstBackSlash) {
Quantity += Puddle_Place_Quantity.top().second;
Puddle_Place_Quantity.pop();
}
//?????????????????????????????????????????\??\???????°´??????????????????
Puddle_Place_Quantity.push(std::pair<int, int>(
PlaceFirstBackSlash, i - PlaceFirstBackSlash + Quantity));
}
}
}
int TotalQuantity = 0;
std::vector<int> Puddle_Quantity(Puddle_Place_Quantity.size());
for (unsigned int i = 0; i < Puddle_Quantity.size(); ++i) {
Puddle_Quantity[i] = Puddle_Place_Quantity.top().second;
Puddle_Place_Quantity.pop();
TotalQuantity += Puddle_Quantity[i];
}
std::cout << TotalQuantity << std::endl;
std::cout << Puddle_Quantity.size();
for (unsigned int i = Puddle_Quantity.size() - 1; i >= 0; --i) {
std::cout << " " << Puddle_Quantity[i];
}
std::cout << std::endl;
// system("pause");
return 0;
}
|
#include <iostream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
int main(void) {
std::string Input;
std::cin >> Input;
std::stack<int> PlaceBackSlash;
std::stack<std::pair<int, int>> Puddle_Place_Quantity;
for (unsigned int i = 0; i < Input.size(); ++i) {
if (Input[i] == '\\') {
PlaceBackSlash.push(i);
} else if (Input[i] == '/') {
if (!(PlaceBackSlash.empty())) {
//???????????????????????\?????´???
int PlaceFirstBackSlash = PlaceBackSlash.top();
PlaceBackSlash.pop();
int Quantity = 0;
//??????????????\??¨?°´?????????????????????????????\??\???????°´???????¶??????????
while (!(Puddle_Place_Quantity.empty()) &&
Puddle_Place_Quantity.top().first > PlaceFirstBackSlash) {
Quantity += Puddle_Place_Quantity.top().second;
Puddle_Place_Quantity.pop();
}
//?????????????????????????????????????????\??\???????°´??????????????????
Puddle_Place_Quantity.push(std::pair<int, int>(
PlaceFirstBackSlash, i - PlaceFirstBackSlash + Quantity));
}
}
}
int TotalQuantity = 0;
std::vector<int> Puddle_Quantity(Puddle_Place_Quantity.size());
for (unsigned int i = 0; i < Puddle_Quantity.size(); ++i) {
Puddle_Quantity[i] = Puddle_Place_Quantity.top().second;
Puddle_Place_Quantity.pop();
TotalQuantity += Puddle_Quantity[i];
}
std::cout << TotalQuantity << std::endl;
std::cout << Puddle_Quantity.size();
for (int i = Puddle_Quantity.size() - 1; i >= 0; --i) {
std::cout << " " << Puddle_Quantity[i];
}
std::cout << std::endl;
// system("pause");
return 0;
}
|
replace
| 40 | 41 | 40 | 41 |
-11
| |
p02266
|
C++
|
Runtime Error
|
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define UP '/'
#define DOWN '\\'
#define FLAT '_'
#define END 20001
int calc_area(int i, int j, const string *input) {
int area = 0, d = 0;
while (i < j) {
if ((*input)[i] == UP)
area += d--;
else if ((*input)[i] == DOWN)
area += d++;
else
area += d;
i++;
}
return area;
}
int main(void) {
vector<int> areas, heights;
string input;
cin >> input;
int h = 0;
heights.push_back(0);
for (auto x : input) {
if (x == DOWN)
h--;
else if (x == UP)
h++;
heights.push_back(h);
}
heights.push_back(END);
int i = 0, k = 0, total = 0;
while (heights[i] != END) {
int j = i + 1;
while (heights[j] != END && heights[j] < heights[i])
j++;
if (heights[i] == heights[j]) {
int area = calc_area(i, j, &input);
if (area > 0) {
total += area;
areas.push_back(area);
k++;
}
i = j;
} else
i++;
}
printf("%d\n%d ", total, k);
for (int i = 0; i < k - 1; i++)
printf("%d ", areas[i]);
printf("%d\n", areas[k - 1]);
return 0;
}
|
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define UP '/'
#define DOWN '\\'
#define FLAT '_'
#define END 20001
int calc_area(int i, int j, const string *input) {
int area = 0, d = 0;
while (i < j) {
if ((*input)[i] == UP)
area += d--;
else if ((*input)[i] == DOWN)
area += d++;
else
area += d;
i++;
}
return area;
}
int main(void) {
vector<int> areas, heights;
string input;
cin >> input;
int h = 0;
heights.push_back(0);
for (auto x : input) {
if (x == DOWN)
h--;
else if (x == UP)
h++;
heights.push_back(h);
}
heights.push_back(END);
int i = 0, k = 0, total = 0;
while (heights[i] != END) {
int j = i + 1;
while (heights[j] != END && heights[j] < heights[i])
j++;
if (heights[i] == heights[j]) {
int area = calc_area(i, j, &input);
if (area > 0) {
total += area;
areas.push_back(area);
k++;
}
i = j;
} else
i++;
}
printf("%d\n%d", total, k);
if (k > 0)
for (int i = 0; i < k; i++)
printf(" %d", areas[i]);
puts("");
return 0;
}
|
replace
| 59 | 63 | 59 | 64 |
0
| |
p02266
|
C++
|
Runtime Error
|
#include <iostream>
#include <stack>
using namespace std;
int main() {
stack<char> sc;
int lim, m = 0, ds = 0, i = 0, k = 0, SS = 0;
int s[1000];
int rs[1000];
char c;
while (cin >> c) {
sc.push(c);
if (m == 0) {
if (c == '\\')
m++;
} else {
if (c == '/')
m--;
else if (c == '\\')
m++;
}
ds = ds + m;
if ((ds != 0) && (m == 0)) {
s[i++] = ds;
ds = 0;
lim = sc.size();
for (int j = 0; j < lim; j++)
sc.pop();
}
}
m = 0;
ds = 0;
lim = sc.size();
for (int j = 0; j < lim; j++) {
c = sc.top();
sc.pop();
if (m == 0) {
if (c == '/')
m++;
} else {
if (c == '\\')
m--;
else if (c == '/')
m++;
}
ds = ds + m;
if ((ds != 0) && (m == 0)) {
rs[k++] = ds;
ds = 0;
}
}
for (int j = 0; j < i; j++)
SS = SS + s[j];
for (int j = 0; j < k; j++)
SS = SS + rs[j];
cout << SS << endl;
cout << i + k;
for (int j = 0; j < i; j++)
cout << ' ' << s[j];
for (int j = k - 1; j >= 0; j--)
cout << ' ' << rs[j];
cout << endl;
return 0;
}
|
#include <iostream>
#include <stack>
using namespace std;
int main() {
stack<char> sc;
int lim, m = 0, ds = 0, i = 0, k = 0, SS = 0;
int s[10000];
int rs[10000];
char c;
while (cin >> c) {
sc.push(c);
if (m == 0) {
if (c == '\\')
m++;
} else {
if (c == '/')
m--;
else if (c == '\\')
m++;
}
ds = ds + m;
if ((ds != 0) && (m == 0)) {
s[i++] = ds;
ds = 0;
lim = sc.size();
for (int j = 0; j < lim; j++)
sc.pop();
}
}
m = 0;
ds = 0;
lim = sc.size();
for (int j = 0; j < lim; j++) {
c = sc.top();
sc.pop();
if (m == 0) {
if (c == '/')
m++;
} else {
if (c == '\\')
m--;
else if (c == '/')
m++;
}
ds = ds + m;
if ((ds != 0) && (m == 0)) {
rs[k++] = ds;
ds = 0;
}
}
for (int j = 0; j < i; j++)
SS = SS + s[j];
for (int j = 0; j < k; j++)
SS = SS + rs[j];
cout << SS << endl;
cout << i + k;
for (int j = 0; j < i; j++)
cout << ' ' << s[j];
for (int j = k - 1; j >= 0; j--)
cout << ' ' << rs[j];
cout << endl;
return 0;
}
|
replace
| 7 | 9 | 7 | 9 |
0
| |
p02266
|
C++
|
Runtime Error
|
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <queue>
#include <stack>
#include <string>
#include <vector>
// #include<cmath>
using namespace std;
int main(void) {
int i = 0, sum = 0, k = 0, a, b;
string s;
stack<int> S;
stack<pair<int, int>> A;
cin >> s;
while (i != s.size()) {
switch (s[i]) {
case '\\':
S.push(i);
break;
case '_':
i++;
continue;
case '/':
if (!S.empty()) {
sum += i - S.top();
A.push(make_pair(S.top(), i - S.top()));
S.pop();
}
}
i++;
}
cout << sum << endl;
vector<pair<int, int>> V;
for (; !A.empty();) {
if (V.empty()) {
V.push_back(make_pair(A.top().first, A.top().second));
A.pop();
} else {
if (A.top().first > V[k].first &&
A.top().first + A.top().second < V[k].second + V[k].first) {
V[k].second += A.top().second;
A.pop();
} else {
k++;
V.push_back(make_pair(A.top().first, A.top().second));
A.pop();
}
}
}
cout << k + 1;
i = 0;
for (int j = k; j >= 0; j--) {
cout << " " << V[j].second;
}
cout << endl;
return 0;
}
|
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <queue>
#include <stack>
#include <string>
#include <vector>
// #include<cmath>
using namespace std;
int main(void) {
int i = 0, sum = 0, k = 0, a, b;
string s;
stack<int> S;
stack<pair<int, int>> A;
cin >> s;
while (i != s.size()) {
switch (s[i]) {
case '\\':
S.push(i);
break;
case '_':
i++;
continue;
case '/':
if (!S.empty()) {
sum += i - S.top();
A.push(make_pair(S.top(), i - S.top()));
S.pop();
}
}
i++;
}
cout << sum << endl;
vector<pair<int, int>> V;
for (; !A.empty();) {
if (V.empty()) {
V.push_back(make_pair(A.top().first, A.top().second));
A.pop();
} else {
if (A.top().first > V[k].first &&
A.top().first + A.top().second < V[k].second + V[k].first) {
V[k].second += A.top().second;
A.pop();
} else {
k++;
V.push_back(make_pair(A.top().first, A.top().second));
A.pop();
}
}
}
if (!V.empty()) {
cout << k + 1;
i = 0;
for (int j = k; j >= 0; j--) {
cout << " " << V[j].second;
}
cout << endl;
} else
cout << k << endl;
return 0;
}
|
replace
| 54 | 60 | 54 | 63 |
0
| |
p02266
|
C++
|
Runtime Error
|
#include <iostream>
#include <stack>
#include <stdio.h>
#define BUF_SIZE 20000
using namespace std;
stack<int> ST;
void calcS() {}
int main() {
char buf[BUF_SIZE];
int heightTable[BUF_SIZE], maxHeightTable[BUF_SIZE], height = 0,
maxHeight = 0, i;
fgets(buf, BUF_SIZE, stdin);
char current, history = 's';
for (i = 0;; i++) {
current = buf[i];
if (history == '/') {
height += 1;
} else if (history == '\\') {
height -= 1;
} else {
// nothing
}
heightTable[i] = height;
if (i == 0) {
if (buf[0] == '\\') {
maxHeightTable[i] = 0;
} else {
maxHeightTable[i] = -1;
}
} else {
maxHeightTable[i] = maxHeightTable[i - 1];
}
if (maxHeight <= height && ((history == '/' && current == '\\') ||
(history == '_' && current == '\\') ||
(history == '/' && current == '\n'))) {
maxHeightTable[i] = i;
maxHeight = height;
}
history = current;
if (current == '\n') {
break;
}
}
int total = 0, left = 0, baseHeight = 0, S = 0, tmp, joutei = 0, katei = 0,
k = 0, pool_count = 0;
for (; i > 0;) {
if (maxHeightTable[i - 1] == -1) {
break;
} else {
if (buf[i - 1] == '/') {
tmp = 0;
if (maxHeightTable[i] == i ||
heightTable[i] > heightTable[maxHeightTable[i - 1]]) {
left = maxHeightTable[i - 1];
baseHeight = heightTable[left];
k = left;
while (true) {
joutei = 10 * (baseHeight - heightTable[k]);
katei = 10 * (baseHeight - heightTable[k + 1]);
tmp += (joutei + katei) / 2;
if (baseHeight == heightTable[k + 1]) {
break;
}
k++;
}
S = tmp / 10;
if (S != 0) {
total += S;
ST.push(S);
pool_count++;
}
i = left;
} else {
for (k = i - 1; k >= 0; k--) {
if (heightTable[k] == heightTable[i]) {
break;
}
}
left = k;
baseHeight = heightTable[left];
while (true) {
joutei = 10 * (baseHeight - heightTable[k]);
katei = 10 * (baseHeight - heightTable[k + 1]);
tmp += (joutei + katei) / 2;
if (baseHeight == heightTable[k + 1]) {
break;
}
k += 1;
}
S = tmp / 10;
if (S != 0) {
total += S;
ST.push(S);
pool_count++;
}
i = left;
}
} else {
i--;
}
}
}
printf("%d\n", total);
printf("%d", pool_count);
while (!ST.empty()) {
printf(" %d", ST.top());
ST.pop();
}
printf("\n");
}
|
#include <iostream>
#include <stack>
#include <stdio.h>
#define BUF_SIZE 20008
using namespace std;
stack<int> ST;
void calcS() {}
int main() {
char buf[BUF_SIZE];
int heightTable[BUF_SIZE], maxHeightTable[BUF_SIZE], height = 0,
maxHeight = 0, i;
fgets(buf, BUF_SIZE, stdin);
char current, history = 's';
for (i = 0;; i++) {
current = buf[i];
if (history == '/') {
height += 1;
} else if (history == '\\') {
height -= 1;
} else {
// nothing
}
heightTable[i] = height;
if (i == 0) {
if (buf[0] == '\\') {
maxHeightTable[i] = 0;
} else {
maxHeightTable[i] = -1;
}
} else {
maxHeightTable[i] = maxHeightTable[i - 1];
}
if (maxHeight <= height && ((history == '/' && current == '\\') ||
(history == '_' && current == '\\') ||
(history == '/' && current == '\n'))) {
maxHeightTable[i] = i;
maxHeight = height;
}
history = current;
if (current == '\n') {
break;
}
}
int total = 0, left = 0, baseHeight = 0, S = 0, tmp, joutei = 0, katei = 0,
k = 0, pool_count = 0;
for (; i > 0;) {
if (maxHeightTable[i - 1] == -1) {
break;
} else {
if (buf[i - 1] == '/') {
tmp = 0;
if (maxHeightTable[i] == i ||
heightTable[i] > heightTable[maxHeightTable[i - 1]]) {
left = maxHeightTable[i - 1];
baseHeight = heightTable[left];
k = left;
while (true) {
joutei = 10 * (baseHeight - heightTable[k]);
katei = 10 * (baseHeight - heightTable[k + 1]);
tmp += (joutei + katei) / 2;
if (baseHeight == heightTable[k + 1]) {
break;
}
k++;
}
S = tmp / 10;
if (S != 0) {
total += S;
ST.push(S);
pool_count++;
}
i = left;
} else {
for (k = i - 1; k >= 0; k--) {
if (heightTable[k] == heightTable[i]) {
break;
}
}
left = k;
baseHeight = heightTable[left];
while (true) {
joutei = 10 * (baseHeight - heightTable[k]);
katei = 10 * (baseHeight - heightTable[k + 1]);
tmp += (joutei + katei) / 2;
if (baseHeight == heightTable[k + 1]) {
break;
}
k += 1;
}
S = tmp / 10;
if (S != 0) {
total += S;
ST.push(S);
pool_count++;
}
i = left;
}
} else {
i--;
}
}
}
printf("%d\n", total);
printf("%d", pool_count);
while (!ST.empty()) {
printf(" %d", ST.top());
ST.pop();
}
printf("\n");
}
|
replace
| 4 | 5 | 4 | 5 |
0
| |
p02266
|
C++
|
Time Limit Exceeded
|
#include <cstdio>
#include <cstdlib>
#include <cstring>
struct Node {
int x;
int y;
int type;
int S;
Node *next, *prev;
};
Node *nil;
Node *listSearch(int key_y, int type) {
Node *cur = nil->prev;
while (cur != nil && ((cur->y != key_y || cur->type != type))) {
cur = cur->prev;
}
return cur;
}
int puddleCount() {
Node *cur = nil->prev->prev;
int count = 0;
bool puddle_flag = false;
nil->prev->y++;
while (cur != nil && cur->y != 0) {
cur->y += 1;
cur = cur->prev;
}
cur = cur->next->next;
while (cur != nil) {
if (cur->y == -1) {
puddle_flag = true;
}
if (puddle_flag && cur->y == 0) {
count += 1;
puddle_flag = false;
}
cur = cur->next;
}
return count;
}
void init() {
nil = (Node *)malloc(sizeof(Node));
nil->next = nil;
nil->prev = nil;
nil->x = -1;
nil->y = 0;
nil->type = 0;
nil->S = 0;
}
void insert(int x, int y, int type, int S) {
Node *n = (Node *)malloc(sizeof(Node));
n->x = x;
n->y = y;
n->type = type;
n->S = S;
n->prev = nil->prev;
n->next = nil;
nil->prev->next = n;
nil->prev = n;
}
int main() {
char str[20000];
int i, k, S, y;
bool puddle_flag = false;
Node *puddle_end, *cur;
scanf("%s", str);
i = k = S = 0;
init();
while (str[i] != '\0') {
if (str[i] == '\\') {
y = nil->prev->y;
insert(i, y - 1, -1, S);
if (!puddle_flag)
puddle_flag = true;
}
if (puddle_flag && str[i] == '/') {
y = nil->prev->y;
S += i - listSearch(y, -1)->x;
insert(i, y + 1, 1, S);
if (nil->prev->y == 0) {
k++;
puddle_flag = false;
}
}
i++;
}
puddle_end = nil->prev;
while (puddle_end->type != 1) {
puddle_end = puddle_end->prev;
}
nil->prev = puddle_end;
puddle_end->next = nil;
while (nil->prev->y != 0) {
k += puddleCount();
}
printf("%d\n", S);
printf("%d", k);
cur = nil->next->next;
S = 0;
for (i = 0; i < k; i++) {
while (cur->y != 0 || cur->type != 1) {
cur = cur->next;
}
printf(" %d", cur->S - S);
S = cur->S;
cur = cur->next;
}
printf("\n");
return 0;
}
|
#include <cstdio>
#include <cstdlib>
#include <cstring>
struct Node {
int x;
int y;
int type;
int S;
Node *next, *prev;
};
Node *nil;
Node *listSearch(int key_y, int type) {
Node *cur = nil->prev;
while (cur != nil && ((cur->y != key_y || cur->type != type))) {
cur = cur->prev;
}
return cur;
}
int puddleCount() {
Node *cur = nil->prev->prev;
int count = 0;
bool puddle_flag = false;
nil->prev->y++;
while (cur != nil && cur->y != 0) {
cur->y += 1;
cur = cur->prev;
}
cur = cur->next->next;
while (cur != nil) {
if (cur->y == -1) {
puddle_flag = true;
}
if (puddle_flag && cur->y == 0) {
count += 1;
puddle_flag = false;
}
cur = cur->next;
}
return count;
}
void init() {
nil = (Node *)malloc(sizeof(Node));
nil->next = nil;
nil->prev = nil;
nil->x = -1;
nil->y = 0;
nil->type = 0;
nil->S = 0;
}
void insert(int x, int y, int type, int S) {
Node *n = (Node *)malloc(sizeof(Node));
n->x = x;
n->y = y;
n->type = type;
n->S = S;
n->prev = nil->prev;
n->next = nil;
nil->prev->next = n;
nil->prev = n;
}
int main() {
char str[20000];
int i, k, S, y;
bool puddle_flag = false;
Node *puddle_end, *cur;
scanf("%s", str);
i = k = S = 0;
init();
while (str[i] != '\0') {
if (str[i] == '\\') {
y = nil->prev->y;
insert(i, y - 1, -1, S);
if (!puddle_flag)
puddle_flag = true;
}
if (puddle_flag && str[i] == '/') {
y = nil->prev->y;
S += i - listSearch(y, -1)->x;
insert(i, y + 1, 1, S);
if (nil->prev->y == 0) {
k++;
puddle_flag = false;
}
}
i++;
}
puddle_end = nil->prev;
while (puddle_end->type != 1 && puddle_end != nil) {
puddle_end = puddle_end->prev;
}
nil->prev = puddle_end;
puddle_end->next = nil;
while (nil->prev->y != 0) {
k += puddleCount();
}
printf("%d\n", S);
printf("%d", k);
cur = nil->next->next;
S = 0;
for (i = 0; i < k; i++) {
while (cur->y != 0 || cur->type != 1) {
cur = cur->next;
}
printf(" %d", cur->S - S);
S = cur->S;
cur = cur->next;
}
printf("\n");
return 0;
}
|
replace
| 96 | 97 | 96 | 97 |
TLE
| |
p02266
|
C++
|
Time Limit Exceeded
|
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
char ss[20010];
scanf("%s", ss);
const string s = ss;
auto f = [&s](int start) {
vector<pair<char, int>> st;
vector<int> v;
int depth = 0;
int current = 0;
for (size_t i = start; i < s.size(); ++i) {
switch (s[i]) {
case '\\':
current += depth * 2 + 1;
depth += 1;
st.push_back(make_pair(s[i], i));
break;
case '_':
current += depth * 2;
break;
case '/':
depth -= 1;
current += depth * 2 + 1;
if (st.empty()) {
depth = 0;
current = 0;
} else {
st.pop_back();
if (st.empty()) {
v.push_back(current / 2);
depth = 0;
current = 0;
}
}
break;
}
// printf("stacksize: %ld, depth: %d, current: %d\n", st.size(),
// depth,
// current);
}
if (st.empty()) {
return make_pair(v, -2);
} else {
return make_pair(v, st[0].second);
}
};
vector<int> v;
int start = 0;
do {
auto r = f(start);
v.insert(end(v), begin(r.first), end(r.first));
start = r.second + 1;
} while (start != -1);
// for (auto&& i : st) {
// printf("%c %d ", i.first, i.second);
// }
// putchar('\n');
// putchar('\n');
printf("%d\n", accumulate(begin(v), end(v), 0));
if (v.size() == 0) {
printf("%ld\n", v.size());
} else {
printf("%ld ", v.size());
}
for (size_t i = 0; i < v.size(); ++i) {
if (i != v.size() - 1) {
printf("%d ", v[i]);
} else {
printf("%d\n", v[i]);
}
}
}
|
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
char ss[20010];
scanf("%s", ss);
const string s = ss;
auto f = [&s](int start) {
vector<pair<char, int>> st;
vector<int> v;
int depth = 0;
int current = 0;
for (size_t i = start; i < s.size(); ++i) {
switch (s[i]) {
case '\\':
current += depth * 2 + 1;
depth += 1;
st.push_back(make_pair(s[i], i));
break;
case '_':
current += depth * 2;
break;
case '/':
depth -= 1;
current += depth * 2 + 1;
if (st.empty()) {
depth = 0;
current = 0;
} else {
st.pop_back();
if (st.empty()) {
v.push_back(current / 2);
depth = 0;
current = 0;
}
}
break;
}
// printf("stacksize: %ld, depth: %d, current: %d\n", st.size(),
// depth,
// current);
}
if (st.empty()) {
return make_pair(v, -2);
} else {
return make_pair(v, st[0].second);
}
};
vector<int> v;
int start = 0;
do {
auto r = f(start);
v.insert(end(v), begin(r.first), end(r.first));
start = r.second + 1;
if (accumulate(begin(s) + start, end(s), true,
[](bool lhs, char rhs) { return lhs && rhs == '\\'; })) {
// There is no valid area.
break;
}
} while (start != -1);
// for (auto&& i : st) {
// printf("%c %d ", i.first, i.second);
// }
// putchar('\n');
// putchar('\n');
printf("%d\n", accumulate(begin(v), end(v), 0));
if (v.size() == 0) {
printf("%ld\n", v.size());
} else {
printf("%ld ", v.size());
}
for (size_t i = 0; i < v.size(); ++i) {
if (i != v.size() - 1) {
printf("%d ", v[i]);
} else {
printf("%d\n", v[i]);
}
}
}
|
insert
| 61 | 61 | 61 | 66 |
TLE
| |
p02266
|
C++
|
Runtime Error
|
#include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int top = 0, c[10000], area[10000][2] = {};
void push(int x) {
top++;
c[top] = x;
}
int pop() {
top--;
return c[top + 1];
}
int main() {
int sum = 0, cnt = 0;
char ch;
for (int i = 0; cin >> ch; i++) {
if (ch == '\\') {
push(i);
} else if (ch == '/' && top > 0) {
int j = pop(), tmp;
sum += i - j;
tmp = i - j;
while (cnt > 0 && area[cnt][1] > j) {
tmp += area[cnt][0];
cnt--;
}
cnt++;
area[cnt][0] = tmp;
area[cnt][1] = j;
}
}
cout << sum << endl;
cout << cnt;
for (int i = 1; i <= cnt; i++)
cout << " " << area[i][0];
cout << endl;
return 0;
}
|
#include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int top = 0, c[20000], area[20000][2] = {};
void push(int x) {
top++;
c[top] = x;
}
int pop() {
top--;
return c[top + 1];
}
int main() {
int sum = 0, cnt = 0;
char ch;
for (int i = 0; cin >> ch; i++) {
if (ch == '\\') {
push(i);
} else if (ch == '/' && top > 0) {
int j = pop(), tmp;
sum += i - j;
tmp = i - j;
while (cnt > 0 && area[cnt][1] > j) {
tmp += area[cnt][0];
cnt--;
}
cnt++;
area[cnt][0] = tmp;
area[cnt][1] = j;
}
}
cout << sum << endl;
cout << cnt;
for (int i = 1; i <= cnt; i++)
cout << " " << area[i][0];
cout << endl;
return 0;
}
|
replace
| 6 | 7 | 6 | 7 |
0
| |
p02266
|
C++
|
Runtime Error
|
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <stack>
using namespace std;
int main() {
char s;
int N;
stack<int> S1;
stack<pair<int, int>> S2;
int sum = 0;
int ans[1000];
for (int i = 0; cin >> s; i++) {
if (s == '\\') {
S1.push(i);
} else if (s == '/' && S1.size() > 0) {
int j = S1.top();
S1.pop();
int a = i - j;
sum += a;
while (S2.size() > 0 && j < S2.top().first) {
a += S2.top().second;
S2.pop();
}
S2.push(make_pair(i, a));
// cout << S2.top().first <<" " << S2.top().second << " "
//<<sum<< endl;
} else if (s == '\n') {
break;
}
}
N = S2.size();
for (int i = 0; i < N; i++) {
ans[i] = S2.top().second;
S2.pop();
}
cout << sum << endl;
cout << N;
for (int i = N - 1; i >= 0; i--) {
cout << ' ' << ans[i];
}
cout << endl;
return 0;
}
|
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <stack>
using namespace std;
int main() {
char s;
int N;
stack<int> S1;
stack<pair<int, int>> S2;
int sum = 0;
int ans[20000];
for (int i = 0; cin >> s; i++) {
if (s == '\\') {
S1.push(i);
} else if (s == '/' && S1.size() > 0) {
int j = S1.top();
S1.pop();
int a = i - j;
sum += a;
while (S2.size() > 0 && j < S2.top().first) {
a += S2.top().second;
S2.pop();
}
S2.push(make_pair(i, a));
// cout << S2.top().first <<" " << S2.top().second << " "
//<<sum<< endl;
} else if (s == '\n') {
break;
}
}
N = S2.size();
for (int i = 0; i < N; i++) {
ans[i] = S2.top().second;
S2.pop();
}
cout << sum << endl;
cout << N;
for (int i = N - 1; i >= 0; i--) {
cout << ' ' << ans[i];
}
cout << endl;
return 0;
}
|
replace
| 13 | 14 | 13 | 14 |
0
| |
p02266
|
C++
|
Runtime Error
|
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
int out(vector<int> &A, int n) {
int i;
for (i = 0; i <= n - 2; i++) {
cout << A[i] << " ";
}
cout << A[n - 1] << endl;
}
int main() {
ios::sync_with_stdio(false);
vector<char> C_list;
char c;
while (cin >> c) {
C_list.push_back(c);
}
vector<int> A_list;
int n = C_list.size();
int i = 0;
while (i < n) {
char s = C_list[i];
if (s == '\\') {
int j = i;
int A2 = 1;
int height = -1;
while (height < 0) {
j++;
if (j == n) {
break;
}
char s2 = C_list[j];
if (s2 == '/') {
A2 += (-2 * height - 1);
height += 1;
} else if (s2 == '\\') {
A2 += (-2 * height + 1);
height -= 1;
} else {
A2 += (-2 * height);
}
}
if (height == 0) {
A_list.push_back(A2 / 2);
i = j;
}
}
i++;
}
int A = accumulate(A_list.begin(), A_list.end(), 0);
cout << A << endl;
int m = A_list.size();
cout << m << " ";
out(A_list, m);
return 0;
}
|
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
int out(vector<int> &A, int n) {
int i;
for (i = 0; i <= n - 2; i++) {
cout << A[i] << " ";
}
cout << A[n - 1] << endl;
}
int main() {
ios::sync_with_stdio(false);
vector<char> C_list;
char c;
while (cin >> c) {
C_list.push_back(c);
}
vector<int> A_list;
int n = C_list.size();
int i = 0;
while (i < n) {
char s = C_list[i];
if (s == '\\') {
int j = i;
int A2 = 1;
int height = -1;
while (height < 0) {
j++;
if (j == n) {
break;
}
char s2 = C_list[j];
if (s2 == '/') {
A2 += (-2 * height - 1);
height += 1;
} else if (s2 == '\\') {
A2 += (-2 * height + 1);
height -= 1;
} else {
A2 += (-2 * height);
}
}
if (height == 0) {
A_list.push_back(A2 / 2);
i = j;
}
}
i++;
}
int A = accumulate(A_list.begin(), A_list.end(), 0);
cout << A << endl;
if (A == 0) {
cout << 0 << endl;
} else {
int m = A_list.size();
cout << m << " ";
out(A_list, m);
}
return 0;
}
|
replace
| 56 | 60 | 56 | 63 |
0
| |
p02266
|
C++
|
Runtime Error
|
#include "bits/stdc++.h"
using namespace std;
int main() {
stack<int> S1;
stack<pair<int, int>> S2;
char ch;
int sum = 0;
for (int i = 0; cin >> ch; ++i) {
if (ch == '\\')
S1.push(i);
else if (ch == '/' && S1.size() > 0) {
int j = S1.top();
S1.pop();
sum += i - j;
int a = i - j;
while (S2.size() > 0 && S2.top().first > j) {
a += S2.top().second;
S2.pop();
}
S2.push(make_pair(j, a));
}
}
vector<int> ans;
int t = 0;
while (S2.size() > 0) {
ans.push_back(S2.top().second);
S2.top();
}
reverse(ans.begin(), ans.end());
cout << sum << endl;
cout << ans.size();
for (int i = 0; i < ans.size(); ++i) {
cout << " ";
t += ans[i];
cout << ans[i];
}
cout << endl;
return 0;
}
|
#include "bits/stdc++.h"
using namespace std;
int main() {
stack<int> S1;
stack<pair<int, int>> S2;
char ch;
int sum = 0;
for (int i = 0; cin >> ch; ++i) {
if (ch == '\\')
S1.push(i);
else if (ch == '/' && S1.size() > 0) {
int j = S1.top();
S1.pop();
sum += i - j;
int a = i - j;
while (S2.size() > 0 && S2.top().first > j) {
a += S2.top().second;
S2.pop();
}
S2.push(make_pair(j, a));
}
}
vector<int> ans;
int t = 0;
while (S2.size() > 0) {
ans.push_back(S2.top().second);
S2.pop();
}
reverse(ans.begin(), ans.end());
cout << sum << endl;
cout << ans.size();
for (int i = 0; i < ans.size(); ++i) {
cout << " ";
t += ans[i];
cout << ans[i];
}
cout << endl;
return 0;
}
|
replace
| 27 | 28 | 27 | 28 |
-6
|
terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
p02266
|
C++
|
Runtime Error
|
/*
** 本题使用两个stack，一个用来统计总积水，一个用来统计单独的积水面积。
*/
#include <cstdio>
#include <stack>
#include <vector>
using namespace std;
static const int maxn = 20000 + 10;
char buff[maxn];
int main() {
// freopen("data.in", "r", stdin);
// freopen("data.out", "w", stdout);
while (scanf("%s", buff) != EOF) {
/*
** ts用来存储每一个'\'字符的位置，然后当出现'/'字符的时候，通过距离计算积水面积
** ps用来存储每一个'\'所对应的积水面积，默认是0，当出现'/'后，再把面积加进去
*/
stack<int> ts, ps;
int sum = 0;
for (int i = 0; buff[i] != '\0'; i++) {
if (buff[i] == 92) { // 92 是 '\'的 ascii码值
ts.push(i);
ps.push(0);
} else if (buff[i] == 47 && !ts.empty()) { // 47 是 '/'的 ascii码值
int s = i - ts.top();
ts.pop();
sum += s;
while (ps.top() != 0) {
s += ps.top();
ps.pop();
}
ps.pop();
ps.push(s);
}
}
printf("%d\n", sum);
vector<int> v;
while (!ps.empty()) {
if (ps.top() != 0)
v.push_back(ps.top());
ps.pop();
}
printf("%d ", v.size());
for (int i = v.size() - 1; i > 0; i--)
printf("%d ", v[i]);
printf("%d\n", v[0]);
}
return 0;
}
|
/*
** 本题使用两个stack，一个用来统计总积水，一个用来统计单独的积水面积。
*/
#include <cstdio>
#include <stack>
#include <vector>
using namespace std;
static const int maxn = 20000 + 10;
char buff[maxn];
int main() {
// freopen("data.in", "r", stdin);
// freopen("data.out", "w", stdout);
while (scanf("%s", buff) != EOF) {
/*
** ts用来存储每一个'\'字符的位置，然后当出现'/'字符的时候，通过距离计算积水面积
** ps用来存储每一个'\'所对应的积水面积，默认是0，当出现'/'后，再把面积加进去
*/
stack<int> ts, ps;
int sum = 0;
for (int i = 0; buff[i] != '\0'; i++) {
if (buff[i] == 92) { // 92 是 '\'的 ascii码值
ts.push(i);
ps.push(0);
} else if (buff[i] == 47 && !ts.empty()) { // 47 是 '/'的 ascii码值
int s = i - ts.top();
ts.pop();
sum += s;
while (ps.top() != 0) {
s += ps.top();
ps.pop();
}
ps.pop();
ps.push(s);
}
}
printf("%d\n", sum);
vector<int> v;
while (!ps.empty()) {
if (ps.top() != 0)
v.push_back(ps.top());
ps.pop();
}
if (v.size() == 0)
printf("0\n");
else {
printf("%d ", v.size());
for (int i = v.size() - 1; i > 0; i--)
printf("%d ", v[i]);
printf("%d\n", v[0]);
}
}
return 0;
}
|
replace
| 47 | 51 | 47 | 55 |
0
| |
p02266
|
C++
|
Runtime Error
|
#include <iostream>
#include <string>
using namespace std;
struct mountain {
int top = 0;
int topn;
int dis = 0;
};
string s;
mountain m[100];
int area[100] = {0}, ff = 1, wind = 0;
int disp(int num) {
int aa = 0, fff = 0, j = 0;
for (int i = 0; i < num; i++)
aa += area[i];
if (!area[num - 1])
num--;
if (!area[0])
num--, fff = 1, j++;
if (num <= 0)
num = 0;
cout << aa << endl << num;
if (0 < num) {
if (j)
num++;
for (j; j < num; j++)
cout << " " << area[j];
}
cout << endl;
return 0;
}
int calc(int act, int *num) {
int begin = *num - 1, lis = 0;
for (begin; begin >= 0 && act > m[begin].top; begin--) {
if (act - 1 == m[begin].top)
lis++;
}
if (ff || begin == -1)
return 1;
int d = m[begin].dis, max = m[begin].top;
for (int i = m[begin].topn; max >= act; i++) {
if (s[i] == '\\')
max--, d--;
if (s[i] == '_')
d--;
}
area[*num - 1] += d + 1;
for (int i = *num - 1; i > *num - lis - 1; i--) {
area[*num - 1 - lis] += area[i];
area[i] = 0;
m[i].dis = 0;
}
*num -= lis;
return 1;
}
int main() {
int num = 1, act = 0, flag = 0;
m[0].topn = 0;
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '/') {
act++;
flag = calc(act, &num);
m[num].top = act;
m[num].topn = i + 1;
wind = 1;
}
if (s[i] == '_')
m[num].topn = i + 1;
if (s[i] == '\\') {
if (flag)
num++, flag = 0;
ff = 0, act--, wind = 1;
}
if (i == s.size() - 1 && !wind)
num++;
for (int j = 0; j < num; j++)
m[j].dis++;
}
disp(num);
return 0;
}
|
#include <iostream>
#include <string>
using namespace std;
struct mountain {
int top = 0;
int topn;
int dis = 0;
};
string s;
mountain m[10000];
int area[10000] = {0}, ff = 1, wind = 0;
int disp(int num) {
int aa = 0, fff = 0, j = 0;
for (int i = 0; i < num; i++)
aa += area[i];
if (!area[num - 1])
num--;
if (!area[0])
num--, fff = 1, j++;
if (num <= 0)
num = 0;
cout << aa << endl << num;
if (0 < num) {
if (j)
num++;
for (j; j < num; j++)
cout << " " << area[j];
}
cout << endl;
return 0;
}
int calc(int act, int *num) {
int begin = *num - 1, lis = 0;
for (begin; begin >= 0 && act > m[begin].top; begin--) {
if (act - 1 == m[begin].top)
lis++;
}
if (ff || begin == -1)
return 1;
int d = m[begin].dis, max = m[begin].top;
for (int i = m[begin].topn; max >= act; i++) {
if (s[i] == '\\')
max--, d--;
if (s[i] == '_')
d--;
}
area[*num - 1] += d + 1;
for (int i = *num - 1; i > *num - lis - 1; i--) {
area[*num - 1 - lis] += area[i];
area[i] = 0;
m[i].dis = 0;
}
*num -= lis;
return 1;
}
int main() {
int num = 1, act = 0, flag = 0;
m[0].topn = 0;
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '/') {
act++;
flag = calc(act, &num);
m[num].top = act;
m[num].topn = i + 1;
wind = 1;
}
if (s[i] == '_')
m[num].topn = i + 1;
if (s[i] == '\\') {
if (flag)
num++, flag = 0;
ff = 0, act--, wind = 1;
}
if (i == s.size() - 1 && !wind)
num++;
for (int j = 0; j < num; j++)
m[j].dis++;
}
disp(num);
return 0;
}
|
replace
| 11 | 13 | 11 | 13 |
0
| |
p02266
|
C++
|
Runtime Error
|
#include <iostream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
stack<int> sa;
string m;
int cnt = 0, result = 0, high = 0, tmp = 0, h[20000], i;
vector<int> amo;
cin >> m;
for (i = m.size() - 1; i != -1; i--) {
if (m[i] == '\\')
tmp++;
if (m[i] == '/')
tmp--;
if (tmp < 0) {
for (int j = i + 1; j < m.size(); j++)
h[j]++;
high++;
tmp = 0;
}
high = max(high, tmp);
h[i] = high;
}
// for(i=0;i<m.size();i++) cout<<h[i]<<" ";
for (i = 0; i < m.size(); i++) {
// if(i>0) if(h[i]-h[i-1]==1) sa.pop();
if (m[i] == '\\') {
sa.push(i);
} else if (m[i] == '/' && !sa.empty()) {
cnt += i - sa.top();
sa.pop();
if (sa.empty()) {
amo.push_back(cnt);
result += cnt;
cnt = 0;
}
}
if (i < m.size() - 1)
if (h[i + 1] - h[i] != 0)
sa.pop();
}
if (cnt != 0) {
amo.push_back(cnt);
result += cnt;
}
cout << result << endl << amo.size() << " ";
for (i = 0; i < amo.size() - 1; i++)
cout << amo[i] << " ";
cout << amo[amo.size() - 1] << endl;
return 0;
}
|
#include <iostream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
stack<int> sa;
string m;
int cnt = 0, result = 0, high = 0, tmp = 0, h[20000], i;
vector<int> amo;
cin >> m;
for (i = m.size() - 1; i != -1; i--) {
if (m[i] == '\\')
tmp++;
if (m[i] == '/')
tmp--;
if (tmp < 0) {
for (int j = i + 1; j < m.size(); j++)
h[j]++;
high++;
tmp = 0;
}
high = max(high, tmp);
h[i] = high;
}
// for(i=0;i<m.size();i++) cout<<h[i]<<" ";
for (i = 0; i < m.size(); i++) {
// if(i>0) if(h[i]-h[i-1]==1) sa.pop();
if (m[i] == '\\') {
sa.push(i);
} else if (m[i] == '/' && !sa.empty()) {
cnt += i - sa.top();
sa.pop();
if (sa.empty()) {
amo.push_back(cnt);
result += cnt;
cnt = 0;
}
}
if (i < m.size() - 1)
if (h[i + 1] - h[i] != 0)
sa.pop();
}
if (cnt != 0) {
amo.push_back(cnt);
result += cnt;
}
if (amo.empty())
cout << "0" << endl << "0" << endl;
else {
cout << result << endl << amo.size() << " ";
for (i = 0; i < amo.size() - 1; i++)
cout << amo[i] << " ";
cout << amo[amo.size() - 1] << endl;
}
return 0;
}
|
replace
| 50 | 55 | 50 | 58 |
0
| |
p02266
|
C++
|
Time Limit Exceeded
|
#include <algorithm>
#include <iostream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int main() {
stack<int> S1;
stack<pair<int, int>> S2;
char slope;
int i = 0;
int sum = 0;
while (scanf("%s", slope) != EOF) {
if (slope == '\\') {
S1.push(i);
} else if (slope == '/' && S1.size() > 0) {
int j = S1.top();
S1.pop();
sum += i - j;
int a = i - j;
while (S2.size() > 0 && S2.top().first > j) {
a += S2.top().second;
S2.pop();
}
S2.push(make_pair(j, a));
}
i++;
}
vector<int> ans;
int t = 0;
while (S2.size() > 0) {
ans.push_back(S2.top().second);
S2.pop();
}
reverse(ans.begin(), ans.end());
cout << sum << endl;
cout << ans.size();
for (int i = 0; i < ans.size(); i++) {
cout << " ";
t += ans[i];
cout << ans[i];
}
cout << endl;
return 0;
}
|
#include <algorithm>
#include <iostream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int main() {
stack<int> S1;
stack<pair<int, int>> S2;
char slope;
int i = 0;
int sum = 0;
while (cin >> slope) {
if (slope == '\\') {
S1.push(i);
} else if (slope == '/' && S1.size() > 0) {
int j = S1.top();
S1.pop();
sum += i - j;
int a = i - j;
while (S2.size() > 0 && S2.top().first > j) {
a += S2.top().second;
S2.pop();
}
S2.push(make_pair(j, a));
}
i++;
}
vector<int> ans;
int t = 0;
while (S2.size() > 0) {
ans.push_back(S2.top().second);
S2.pop();
}
reverse(ans.begin(), ans.end());
cout << sum << endl;
cout << ans.size();
for (int i = 0; i < ans.size(); i++) {
cout << " ";
t += ans[i];
cout << ans[i];
}
cout << endl;
return 0;
}
|
replace
| 15 | 16 | 15 | 16 |
TLE
| |
p02267
|
C++
|
Runtime Error
|
#include <iostream>
using namespace std;
bool t[10005];
signed main() {
int n, q;
int ans = 0;
cin >> n;
for (int i = 0; i < n; i++) {
int tmp;
cin >> tmp;
t[tmp] = 1;
}
cin >> q;
for (int i = 0; i < q; i++) {
int tmp;
cin >> tmp;
if (t[tmp] == 1) {
ans++;
t[tmp] = 0;
}
}
cout << ans << endl;
return (0);
}
|
#include <iostream>
using namespace std;
const int MAX = 1e9 + 5;
bool t[MAX];
signed main() {
int n, q;
int ans = 0;
cin >> n;
for (int i = 0; i < n; i++) {
int tmp;
cin >> tmp;
t[tmp] = 1;
}
cin >> q;
for (int i = 0; i < q; i++) {
int tmp;
cin >> tmp;
if (t[tmp] == 1) {
ans++;
t[tmp] = 0;
}
}
cout << ans << endl;
return (0);
}
|
replace
| 3 | 4 | 3 | 5 |
0
| |
p02267
|
C++
|
Runtime Error
|
#include <iostream>
using namespace std;
bool linearSearch(int A[], int key, int size) {
int i = 0;
A[size] = key;
while (A[i] != key)
i++;
return i != size;
}
int main() {
int size, query, queryNum, count = 0;
cin >> size;
int *A = new int[size];
for (int i = 0; i < size; i++)
scanf("%d", &A[i]);
cin >> queryNum;
for (int i = 0; i < queryNum; i++) {
scanf("%d", &query);
if (linearSearch(A, query, size))
count++;
}
cout << count << endl;
delete[] A;
}
|
#include <iostream>
using namespace std;
bool linearSearch(int A[], int key, int size) {
int i = 0;
A[size] = key;
while (A[i] != key)
i++;
return i != size;
}
int main() {
int size, query, queryNum, count = 0;
cin >> size;
int *A = new int[size + 1];
for (int i = 0; i < size; i++)
scanf("%d", &A[i]);
cin >> queryNum;
for (int i = 0; i < queryNum; i++) {
scanf("%d", &query);
if (linearSearch(A, query, size))
count++;
}
cout << count << endl;
delete[] A;
}
|
replace
| 15 | 16 | 15 | 16 |
0
| |
p02267
|
C++
|
Runtime Error
|
#include <iostream>
using namespace std;
int main() {
int i, j, n, q, S[10001], T[100], C;
cin >> n;
for (i = 0; i < n; i++)
cin >> S[i];
cin >> q;
for (i = 0; i < q; i++)
cin >> T[i];
C = 0;
for (i = 0; i < q; i++) {
j = 0;
S[n] = T[i];
while (S[j] != S[n])
j++;
if (j < n)
C++;
}
cout << C << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int i, j, n, q, S[10001], T[500], C;
cin >> n;
for (i = 0; i < n; i++)
cin >> S[i];
cin >> q;
for (i = 0; i < q; i++)
cin >> T[i];
C = 0;
for (i = 0; i < q; i++) {
j = 0;
S[n] = T[i];
while (S[j] != S[n])
j++;
if (j < n)
C++;
}
cout << C << endl;
return 0;
}
|
replace
| 4 | 5 | 4 | 5 |
0
| |
p02267
|
C++
|
Runtime Error
|
#include <iostream>
using namespace std;
int main() {
long long n, q, s[1000000001], t, k;
cin >> n;
for (long long i = 0; i < n; i++) {
cin >> s[i];
}
cin >> q;
k = 0;
for (long long i = 0; i < q; i++) {
cin >> t;
for (long long j = 0; j < n; j++) {
if (s[j] == t) {
k++;
break;
}
}
}
cout << k << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
long long n, q, s[10001], t, k;
cin >> n;
for (long long i = 0; i < n; i++) {
cin >> s[i];
}
cin >> q;
k = 0;
for (long long i = 0; i < q; i++) {
cin >> t;
for (long long j = 0; j < n; j++) {
if (s[j] == t) {
k++;
break;
}
}
}
cout << k << endl;
return 0;
}
|
replace
| 4 | 5 | 4 | 5 |
-11
| |
p02267
|
C++
|
Runtime Error
|
#include <iostream>
using namespace std;
int main() {
int n, p;
int s[1000];
int t[1000];
int i, j;
int c = 0;
cin >> n;
for (i = 0; i < n; i++) {
cin >> s[i];
}
cin >> p;
for (i = 0; i < p; i++) {
cin >> t[i];
}
for (i = 0; i < n; i++) {
for (j = 0; j < p; j++) {
if (s[i] == t[j]) {
t[j] = -1;
c++;
}
}
}
cout << c << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int n, p;
int s[1000000];
int t[1000000];
int i, j;
int c = 0;
cin >> n;
for (i = 0; i < n; i++) {
cin >> s[i];
}
cin >> p;
for (i = 0; i < p; i++) {
cin >> t[i];
}
for (i = 0; i < n; i++) {
for (j = 0; j < p; j++) {
if (s[i] == t[j]) {
t[j] = -1;
c++;
}
}
}
cout << c << endl;
return 0;
}
|
replace
| 4 | 6 | 4 | 6 |
0
| |
p02267
|
C++
|
Runtime Error
|
#include <algorithm>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int n;
cin >> n;
vector<int> s(n);
for (int i = 0; i < n; i++) {
cin >> s[i];
}
int q;
cin >> q;
vector<int> t(q);
for (int i = 0; i < q; i++) {
cin >> t[i];
}
sort(s.begin(), s.end());
sort(t.begin(), t.end());
int ans = 0, p = 0;
for (int i = 0; i < n; i++) {
if (t[p] == s[i]) {
ans++;
p++;
} else if (t[p] < s[i]) {
p++;
i--;
}
}
cout << ans << endl;
return 0;
}
|
#include <algorithm>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int n;
cin >> n;
vector<int> s(n);
for (int i = 0; i < n; i++) {
cin >> s[i];
}
int q;
cin >> q;
vector<int> t(q);
for (int i = 0; i < q; i++) {
cin >> t[i];
}
sort(s.begin(), s.end());
sort(t.begin(), t.end());
int ans = 0;
for (int i = 0; i < q; i++) {
for (int j = 0; j < n; j++) {
if (t[i] == s[j]) {
ans++;
i++;
}
}
}
cout << ans << endl;
return 0;
}
|
replace
| 22 | 30 | 22 | 29 |
0
| |
p02267
|
C++
|
Runtime Error
|
#include <iostream>
using namespace std;
int linear(int a[], int key, int n);
int main() {
int i, j, n, q, c = 0;
int s[1000], t[1000];
cin >> n;
for (i = 0; i < n; i++)
cin >> s[i];
cin >> q;
for (i = 0; i < q; i++)
cin >> t[i];
for (i = 0; i < q; i++) {
c = c + linear(s, t[i], n);
}
cout << c << endl;
}
int linear(int a[], int key, int n) {
int i = 0;
a[n] = key;
while (a[i] != key) {
i++;
}
if (i >= n) {
return 0;
} else {
return 1;
}
}
|
#include <iostream>
using namespace std;
int linear(int a[], int key, int n);
int main() {
int i, j, n, q, c = 0;
int s[100000], t[100000];
cin >> n;
for (i = 0; i < n; i++)
cin >> s[i];
cin >> q;
for (i = 0; i < q; i++)
cin >> t[i];
for (i = 0; i < q; i++) {
c = c + linear(s, t[i], n);
}
cout << c << endl;
}
int linear(int a[], int key, int n) {
int i = 0;
a[n] = key;
while (a[i] != key) {
i++;
}
if (i >= n) {
return 0;
} else {
return 1;
}
}
|
replace
| 6 | 7 | 6 | 7 |
0
| |
p02267
|
C++
|
Runtime Error
|
#include <algorithm>
#include <cstdio>
#include <vector>
#define rep(i, N) for (int i = 0; i < N; ++i)
using namespace std;
bool linerSearch(vector<int> vec, int key) {
for (int &v : vec)
if (v == key)
return true;
return false;
}
int main() {
int n, q, key;
scanf("%d", &n);
vector<int> S(n);
rep(i, n) scanf("%d", &S[i]);
int ans = 0;
scanf("%d", &q);
for (int i = 0; i < q; ++i) {
scanf("%d", &key);
if (linerSearch(S, key))
++ans;
}
printf("%d\n", ans);
return 0;
}
|
#include <algorithm>
#include <cstdio>
#include <vector>
#define rep(i, N) for (int i = 0; i < N; ++i)
using namespace std;
bool linerSearch(vector<int> vec, int key) {
auto itr = std::find(vec.begin(), vec.end(), key);
size_t index = std::distance(vec.begin(), itr);
return index != vec.size();
}
int main() {
int n, q, key;
scanf("%d", &n);
vector<int> S(n);
rep(i, n) scanf("%d", &S[i]);
int ans = 0;
scanf("%d", &q);
for (int i = 0; i < q; ++i) {
scanf("%d", &key);
if (linerSearch(S, key))
++ans;
}
printf("%d\n", ans);
return 0;
}
|
replace
| 9 | 13 | 9 | 12 |
0
| |
p02267
|
C++
|
Runtime Error
|
#include <iostream>
using namespace std;
int LSearch(int A[], unsigned int q, int x) {
A[q] = x;
for (int i = 0;; i++) {
if (A[i] == x)
if (i != q)
return 0;
else
return -1;
}
}
int main() {
unsigned int n, q;
unsigned int counter = 0;
int S[1000000000], T;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> S[i];
}
cin >> q;
for (int i = 0; i < q; i++) {
cin >> T;
if (LSearch(S, n, T) == 0)
counter++;
}
cout << counter << endl;
}
|
#include <iostream>
using namespace std;
int LSearch(int A[], unsigned int q, int x) {
A[q] = x;
for (int i = 0;; i++) {
if (A[i] == x)
if (i != q)
return 0;
else
return -1;
}
}
int main() {
unsigned int n, q;
unsigned int counter = 0;
int S[10000000], T;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> S[i];
}
cin >> q;
for (int i = 0; i < q; i++) {
cin >> T;
if (LSearch(S, n, T) == 0)
counter++;
}
cout << counter << endl;
}
|
replace
| 16 | 17 | 16 | 17 |
-11
| |
p02267
|
C++
|
Time Limit Exceeded
|
#include <stdio.h>
int search(int A[], int n, int key) {
int i = 0;
A[n] = key;
while (A[i] != key)
i++;
return (i != n);
}
int main() {
int A[10000 + 1], n, i, q, sum = 0, key;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &A[i]);
scanf("%d", &q);
for (i = 0; i < q; i++) {
scanf("%d", &key);
while (search(A, n, key))
sum++;
}
printf("%d\n", sum);
return 0;
}
|
#include <stdio.h>
int search(int A[], int n, int key) {
int i = 0;
A[n] = key;
while (A[i] != key)
i++;
return (i != n);
}
int main() {
int A[10000 + 1], n, i, q, sum = 0, key;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &A[i]);
scanf("%d", &q);
for (i = 0; i < q; i++) {
scanf("%d", &key);
if (search(A, n, key))
sum++;
}
printf("%d\n", sum);
return 0;
}
|
replace
| 20 | 21 | 20 | 21 |
TLE
| |
p02267
|
C++
|
Runtime Error
|
#include <iostream>
using namespace std;
int Linear_Search(int S[], int T[], int n, int q) {
int result = 0;
for (int i = 0; i < q; i++) {
for (int j = 0; j < n; j++) {
if (T[i] == S[j]) {
result++;
break;
}
}
}
return result;
}
int main() {
int S[1000], T[1000];
int n, q, result;
cin >> n;
for (int i = 0; i < n; i++)
cin >> S[i];
cin >> q;
for (int i = 0; i < q; i++)
cin >> T[i];
result = Linear_Search(S, T, n, q);
cout << result << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int Linear_Search(int S[], int T[], int n, int q) {
int result = 0;
for (int i = 0; i < q; i++) {
for (int j = 0; j < n; j++) {
if (T[i] == S[j]) {
result++;
break;
}
}
}
return result;
}
int main() {
int S[10000], T[1000];
int n, q, result;
cin >> n;
for (int i = 0; i < n; i++)
cin >> S[i];
cin >> q;
for (int i = 0; i < q; i++)
cin >> T[i];
result = Linear_Search(S, T, n, q);
cout << result << endl;
return 0;
}
|
replace
| 18 | 19 | 18 | 19 |
0
| |
p02267
|
C++
|
Runtime Error
|
#include <stdio.h>
int search(int A[], int n, int key) {
int i = 0;
A[n] = key;
while (A[i] != key)
i++;
return i != n;
}
int main() {
int i, n, A[1000 + 1], q, key, sum = 0;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &A[i]);
scanf("%d", &q);
for (i = 0; i < q; i++) {
scanf("%d", &key);
if (search(A, n, key))
sum++;
}
printf("%d\n", sum);
return 0;
}
|
#include <stdio.h>
int search(int A[], int n, int key) {
int i = 0;
A[n] = key;
while (A[i] != key)
i++;
return i != n;
}
int main() {
int i, n, A[10000 + 1], q, key, sum = 0;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &A[i]);
scanf("%d", &q);
for (i = 0; i < q; i++) {
scanf("%d", &key);
if (search(A, n, key))
sum++;
}
printf("%d\n", sum);
return 0;
}
|
replace
| 11 | 12 | 11 | 12 |
0
| |
p02267
|
C++
|
Runtime Error
|
//
// main.cpp
// ALDS1_4_A
//
// Created by ptyuan on 2018/10/22.
// Copyright © 2018 YY. All rights reserved.
//
#include <cstdio>
#include <iostream>
using namespace std;
int linearSearch(int *array, int n, int key) {
*(array + n) = key;
int i = 0;
while (array[i] != key) {
i++;
}
return i == n ? -1 : i;
}
int main(int argc, const char *argv[]) {
int n = 0;
int S[10 ^ 5] = {0};
int q = 0;
int sum = 0;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", S + i);
}
scanf("%d", &q);
for (int i = 0; i < q; i++) {
int key = 0;
scanf("%d", &key);
if (-1 != linearSearch(S, n, key)) {
sum++;
}
}
printf("%d\n", sum);
return 0;
}
|
//
// main.cpp
// ALDS1_4_A
//
// Created by ptyuan on 2018/10/22.
// Copyright © 2018 YY. All rights reserved.
//
#include <cstdio>
#include <iostream>
using namespace std;
int linearSearch(int *array, int n, int key) {
*(array + n) = key;
int i = 0;
while (array[i] != key) {
i++;
}
return i == n ? -1 : i;
}
int main(int argc, const char *argv[]) {
int n = 0;
int S[10000 + 1] = {0};
int q = 0;
int sum = 0;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", S + i);
}
scanf("%d", &q);
for (int i = 0; i < q; i++) {
int key = 0;
scanf("%d", &key);
if (-1 != linearSearch(S, n, key)) {
sum++;
}
}
printf("%d\n", sum);
return 0;
}
|
replace
| 23 | 24 | 23 | 24 |
0
| |
p02267
|
C++
|
Runtime Error
|
#include <iostream>
#include <vector>
using namespace std;
void fnInput(vector<int> &a_rvoTarget, vector<int> &a_rvoSearch) {
int iTargetCnt;
cin >> iTargetCnt;
a_rvoTarget.resize(iTargetCnt + 1);
for (int i = 0; i < iTargetCnt; i++)
cin >> a_rvoTarget[i];
int iSearchCnt;
cin >> iSearchCnt;
a_rvoSearch.resize(iSearchCnt);
for (int i = 0; i < iSearchCnt; i++)
cin >> a_rvoSearch[i];
}
void fnLinearSearch(vector<int> &a_rvoTarget, const vector<int> &a_cnrvoSearch,
int &a_riFound) {
size_t zMaxSize = a_rvoTarget.size() - 1;
for (size_t zi = 0; zi < a_cnrvoSearch.size(); zi++) {
a_rvoTarget[zMaxSize] = a_cnrvoSearch[zi];
size_t zj = 0;
while (a_rvoTarget[zj] = a_cnrvoSearch[zi])
zj++;
if (zj != zMaxSize)
a_riFound++;
}
}
void fnResultOut(int a_iFound) { cout << a_iFound << endl; }
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
vector<int> voTarget, voSearch;
int iFound = 0;
fnInput(voTarget, voSearch);
fnLinearSearch(voTarget, voSearch, iFound);
fnResultOut(iFound);
return 0;
}
|
#include <iostream>
#include <vector>
using namespace std;
void fnInput(vector<int> &a_rvoTarget, vector<int> &a_rvoSearch) {
int iTargetCnt;
cin >> iTargetCnt;
a_rvoTarget.resize(iTargetCnt + 1);
for (int i = 0; i < iTargetCnt; i++)
cin >> a_rvoTarget[i];
int iSearchCnt;
cin >> iSearchCnt;
a_rvoSearch.resize(iSearchCnt);
for (int i = 0; i < iSearchCnt; i++)
cin >> a_rvoSearch[i];
}
void fnLinearSearch(vector<int> &a_rvoTarget, const vector<int> &a_cnrvoSearch,
int &a_riFound) {
size_t zMaxSize = a_rvoTarget.size() - 1;
for (size_t zi = 0; zi < a_cnrvoSearch.size(); zi++) {
a_rvoTarget[zMaxSize] = a_cnrvoSearch[zi];
size_t zj = 0;
while (a_rvoTarget[zj] != a_cnrvoSearch[zi])
zj++;
if (zj != zMaxSize)
a_riFound++;
}
}
void fnResultOut(int a_iFound) { cout << a_iFound << endl; }
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
vector<int> voTarget, voSearch;
int iFound = 0;
fnInput(voTarget, voSearch);
fnLinearSearch(voTarget, voSearch, iFound);
fnResultOut(iFound);
return 0;
}
|
replace
| 26 | 27 | 26 | 27 |
-11
| |
p02267
|
C++
|
Runtime Error
|
#include <iostream>
using namespace std;
int searcher(int A[], int n, int key) {
int i = 0;
A[n] = key;
while (A[i] != key)
i++;
return (i != n);
}
int main() {
int A[1000 + 1], key, q, n;
int sum = 0;
cin >> n;
for (int i = 0; i < n; i++)
cin >> A[i];
cin >> q;
for (int i = 0; i < q; i++) {
cin >> key;
if (searcher(A, n, key))
sum++;
}
cout << sum << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int searcher(int A[], int n, int key) {
int i = 0;
A[n] = key;
while (A[i] != key)
i++;
return (i != n);
}
int main() {
int A[10000 + 10], key, q, n;
int sum = 0;
cin >> n;
for (int i = 0; i < n; i++)
cin >> A[i];
cin >> q;
for (int i = 0; i < q; i++) {
cin >> key;
if (searcher(A, n, key))
sum++;
}
cout << sum << endl;
return 0;
}
|
replace
| 13 | 14 | 13 | 14 |
0
| |
p02267
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
bool flag[10000];
int main() {
int n, m;
cin >> n;
int s[10000], t[10000];
rep(i, n) cin >> s[i];
cin >> m;
int cnt = 0;
rep(i, m) cin >> t[i];
rep(i, n) {
rep(j, m) {
if (s[i] == t[j] && flag[s[i]] == false) {
cnt++;
flag[s[i]] = true;
break;
}
}
}
cout << cnt << endl;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
bool flag[1000000000];
signed main() {
int n, m;
cin >> n;
int s[10000], t[10000];
rep(i, n) cin >> s[i];
cin >> m;
int cnt = 0;
rep(i, m) cin >> t[i];
rep(i, n) {
rep(j, m) {
if (s[i] == t[j] && flag[s[i]] == false) {
cnt++;
flag[s[i]] = true;
break;
}
}
}
cout << cnt << endl;
}
|
replace
| 3 | 5 | 3 | 5 |
0
| |
p02267
|
C++
|
Runtime Error
|
#include <algorithm>
#include <cstdio>
typedef long long int lli;
lli s[20000], t[2000];
int main(void) {
int n, q;
scanf("%d", &n);
for (int i = 0; i < n; i++)
scanf("%lld", &s[i]);
scanf("%d", &q);
for (int i = 0; i < q; i++)
scanf("%lld", &t[i]);
std::sort(s, s + n);
std::sort(t, t + q);
lli *ps = s, *pt = t;
int res = 0;
while (ps < s + n, pt < t + q) {
if (*ps == *pt)
res++, ps++, pt++;
else if (*ps < *pt)
ps++;
else
pt++;
}
printf("%d\n", res);
return 0;
}
|
#include <algorithm>
#include <cstdio>
typedef long long int lli;
lli s[20000], t[2000];
int main(void) {
int n, q;
scanf("%d", &n);
for (int i = 0; i < n; i++)
scanf("%lld", &s[i]);
scanf("%d", &q);
for (int i = 0; i < q; i++)
scanf("%lld", &t[i]);
std::sort(s, s + n);
std::sort(t, t + q);
lli *ps = s, *pt = t;
int res = 0;
while (ps < s + n && pt < t + q) {
if (*ps == *pt)
res++, ps++, pt++;
else if (*ps < *pt)
ps++;
else
pt++;
}
printf("%d\n", res);
return 0;
}
|
replace
| 20 | 21 | 20 | 21 |
0
| |
p02267
|
C++
|
Runtime Error
|
#include <cstdio>
using namespace std;
int a[1005];
bool Find(int n, int key) {
int i = 0;
a[n] = key;
while (a[i] != key)
i++;
if (i != n)
return true;
else
return false;
}
int main() {
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++)
scanf("%d", &a[i]);
int q, key, cnt = 0;
scanf("%d", &q);
for (int i = 0; i < q; i++) {
scanf("%d", &key);
if (Find(n, key))
cnt++;
}
printf("%d\n", cnt);
return 0;
}
|
#include <cstdio>
using namespace std;
int a[10005];
bool Find(int n, int key) {
int i = 0;
a[n] = key;
while (a[i] != key)
i++;
if (i != n)
return true;
else
return false;
}
int main() {
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++)
scanf("%d", &a[i]);
int q, key, cnt = 0;
scanf("%d", &q);
for (int i = 0; i < q; i++) {
scanf("%d", &key);
if (Find(n, key))
cnt++;
}
printf("%d\n", cnt);
return 0;
}
|
replace
| 3 | 4 | 3 | 4 |
0
| |
p02268
|
C++
|
Runtime Error
|
#include <iostream>
using namespace std;
int A[10001], n;
int binarySearch(int key) {
int left = 0;
int right = n;
int i = 0;
int mid;
while (left < right) {
mid = (left + right) / 2;
if (key == A[mid]) {
return 1;
}
if (key > A[mid])
left = mid + 1;
else if (key < A[mid])
right = mid;
}
return 0;
}
int main() {
int q, i, k, ans = 0;
cin >> n;
for (i = 0; i < n; i++)
cin >> A[i];
cin >> q;
for (i = 0; i < q; i++) {
cin >> k;
if (binarySearch(k))
ans++;
}
cout << ans << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int A[100000], n;
int binarySearch(int key) {
int left = 0;
int right = n;
int i = 0;
int mid;
while (left < right) {
mid = (left + right) / 2;
if (key == A[mid]) {
return 1;
}
if (key > A[mid])
left = mid + 1;
else if (key < A[mid])
right = mid;
}
return 0;
}
int main() {
int q, i, k, ans = 0;
cin >> n;
for (i = 0; i < n; i++)
cin >> A[i];
cin >> q;
for (i = 0; i < q; i++) {
cin >> k;
if (binarySearch(k))
ans++;
}
cout << ans << endl;
return 0;
}
|
replace
| 3 | 4 | 3 | 4 |
0
| |
p02268
|
C++
|
Time Limit Exceeded
|
#include <algorithm>
#include <iostream>
using namespace std;
int binarySearch(int A[], int n, int key) {
size_t left = 0;
size_t right = n;
size_t mid = (left + right) / 2;
while (left < right) {
if (A[mid] == key)
return 1;
if (A[mid] < key)
left = mid + 1;
else if (A[mid] > key)
right = mid;
}
return 0;
}
int main() {
int n, q;
int S[100'000];
cin >> n;
for (int i = 0; i < n; i++)
cin >> S[i];
cin >> q;
int key;
int count = 0;
for (int i = 0; i < q; i++) {
cin >> key;
if (binarySearch(S, n, key))
count++;
}
cout << count << endl;
}
|
#include <algorithm>
#include <iostream>
using namespace std;
int binarySearch(int A[], int n, int key) {
size_t left = 0;
size_t right = n;
size_t mid = (left + right) / 2;
while (left < right) {
mid = (left + right) / 2;
if (A[mid] == key)
return 1;
if (A[mid] < key)
left = mid + 1;
else if (A[mid] > key)
right = mid;
}
return 0;
}
int main() {
int n, q;
int S[100'000];
cin >> n;
for (int i = 0; i < n; i++)
cin >> S[i];
cin >> q;
int key;
int count = 0;
for (int i = 0; i < q; i++) {
cin >> key;
if (binarySearch(S, n, key))
count++;
}
cout << count << endl;
}
|
insert
| 9 | 9 | 9 | 10 |
TLE
| |
p02268
|
C++
|
Runtime Error
|
#include <iostream>
using namespace std;
int b[10 ^ 9 + 1];
int main() {
int n, q, s, t;
int ans = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> s;
b[s]++;
}
cin >> q;
for (int i = 0; i < q; i++) {
cin >> t;
if (b[t] >= 1)
ans++;
}
cout << ans << endl;
return (0);
}
|
#include <iostream>
using namespace std;
int b[1000000010];
int main() {
int n, q, s, t;
int ans = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> s;
b[s]++;
}
cin >> q;
for (int i = 0; i < q; i++) {
cin >> t;
if (b[t] >= 1)
ans++;
}
cout << ans << endl;
return (0);
}
|
replace
| 4 | 5 | 4 | 5 |
0
| |
p02268
|
C++
|
Runtime Error
|
#include <cstdio>
#include <iostream>
using namespace std;
int A[10000], B[10000], NA, NB;
int binarysearch(int key) {
int left = 0, right = NA - 1;
while (left <= right) {
int mid = (left + right) / 2;
if (A[mid] == key)
return 1;
else if (A[mid] < key)
left = mid + 1;
else
right = mid - 1;
}
return 0;
}
int main() {
int sum = 0;
cin >> NA;
for (int i = 0; i < NA; i++) {
cin >> A[i];
}
cin >> NB;
for (int i = 0; i < NB; i++) {
cin >> B[i];
if (binarysearch(B[i]))
sum++;
}
cout << sum << endl;
return 0;
}
|
#include <cstdio>
#include <iostream>
using namespace std;
int A[100000], B[100000], NA, NB;
int binarysearch(int key) {
int left = 0, right = NA - 1;
while (left <= right) {
int mid = (left + right) / 2;
if (A[mid] == key)
return 1;
else if (A[mid] < key)
left = mid + 1;
else
right = mid - 1;
}
return 0;
}
int main() {
int sum = 0;
cin >> NA;
for (int i = 0; i < NA; i++) {
cin >> A[i];
}
cin >> NB;
for (int i = 0; i < NB; i++) {
cin >> B[i];
if (binarysearch(B[i]))
sum++;
}
cout << sum << endl;
return 0;
}
|
replace
| 4 | 5 | 4 | 5 |
0
| |
p02268
|
C++
|
Time Limit Exceeded
|
#include <stdio.h>
bool FindByBinarySearch(int x, int A[], int left, int right) {
int mid = (left + right) / 2;
if (x == A[mid])
return true;
if (x >= A[left] && x < A[mid])
return FindByBinarySearch(x, A, left, mid);
if (x > A[mid] && x <= A[right])
return FindByBinarySearch(x, A, mid + 1, right);
return false;
}
int main() {
int n, q, S[100000], T[50000];
int C = 0;
scanf("%d", &n);
for (int i = 0; i < n; ++i) {
scanf("%d", &S[i]);
}
scanf("%d", &q);
for (int i = 0; i < q; ++i) {
scanf("%d", &T[i]);
}
for (int i = 0; i < q; ++i) {
for (int j = 0; j < n; ++j) {
if (FindByBinarySearch(T[i], S, 0, n - 1)) {
++C;
break;
}
}
}
printf("%d\n", C);
return 0;
}
|
#include <stdio.h>
bool FindByBinarySearch(int x, int A[], int left, int right) {
int mid = (left + right) / 2;
if (x == A[mid])
return true;
if (x >= A[left] && x < A[mid])
return FindByBinarySearch(x, A, left, mid);
if (x > A[mid] && x <= A[right])
return FindByBinarySearch(x, A, mid + 1, right);
return false;
}
int main() {
int n, q, S[100000], T[50000];
int C = 0;
scanf("%d", &n);
for (int i = 0; i < n; ++i) {
scanf("%d", &S[i]);
}
scanf("%d", &q);
for (int i = 0; i < q; ++i) {
scanf("%d", &T[i]);
}
for (int i = 0; i < q; ++i) {
if (FindByBinarySearch(T[i], S, 0, n - 1)) {
++C;
}
}
printf("%d\n", C);
return 0;
}
|
replace
| 29 | 34 | 29 | 31 |
TLE
| |
p02268
|
C++
|
Time Limit Exceeded
|
#include <stdio.h>
#define N 100000
int count = 0;
void BinarySearch(int array[], int right, int left, int key) {
int mid = (right + left) / 2;
if (left > right) {
return;
}
if (array[mid] == key) {
count++;
return;
} else if (array[mid] < key) {
BinarySearch(array, right, mid + 1, key);
} else {
BinarySearch(array, mid, left, key);
}
}
int main() {
int i, n, array[N];
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &array[i]);
int m;
scanf("%d", &m);
for (i = 0; i < m; i++) {
int l;
scanf("%d", &l);
BinarySearch(array, n, 0, l);
}
printf("%d\n", count);
}
|
#include <stdio.h>
#define N 100000
int count = 0;
void BinarySearch(int array[], int right, int left, int key) {
while (left < right) {
int mid = (left + right) / 2;
if (array[mid] == key) {
count++;
break;
} else if (array[mid] < key) {
left = mid + 1;
} else {
right = mid;
}
}
}
int main() {
int i, n, array[N];
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &array[i]);
int m;
scanf("%d", &m);
for (i = 0; i < m; i++) {
int l;
scanf("%d", &l);
BinarySearch(array, n, 0, l);
}
printf("%d\n", count);
}
|
replace
| 4 | 16 | 4 | 14 |
TLE
| |
p02268
|
C++
|
Runtime Error
|
#include <iostream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
using namespace std;
// 常に心してかかれ
// 簡単なことを簡単にできるように練習する
int main() {
int n;
int q;
int tmp;
int C = 0;
int num_to_check;
int S[10001];
int head;
int tail;
int mid; // 中央値
stack<int> T;
cin >> n;
for (int i = 0; i < n; i++) {
scanf("%d", &S[i]);
}
/*確認
for(int i=0;i<n;i++){
cout <<S[i] <<" ";
}
cout <<endl;
*/
cin >> q;
for (int i = 0; i < q; i++) {
scanf("%d", &tmp);
T.push(tmp);
}
/*確認
while(!T.empty()){
cout <<T.top() <<" ";
T.pop();
}
cout <<endl;
*/
// 高速化用コード
int j = 1;
for (int i = 1; i < n; i++) {
if (S[i] == S[i - 1]) {
;
} else {
j++;
S[j] = S[i];
}
}
n = j + 1;
//
while (!T.empty()) {
num_to_check = T.top();
T.pop();
head = 0;
tail = n - 1;
// キーの探索
while (head <= tail) {
// 高速化用コード
if (num_to_check < S[0] || num_to_check > S[n - 1])
break;
//
if (head == tail) {
if (num_to_check == S[head /*==tail*/]) {
C++;
break;
} else {
break;
}
}
mid = (head + tail) / 2;
if (num_to_check == S[mid]) { // 見つかった(中央の値と一致)
C++;
break;
} else { // 中央の値と一致しない
if (head == tail - 1) {
if (num_to_check == S[head] || num_to_check == S[tail]) {
C++;
break;
} else {
break;
}
}
if (num_to_check > S[mid]) { // 中央の値より大きい
head = mid + 1;
// cout <<"head" <<head <<"tail" <<tail <<endl;
} else { // 中央の値より小さい
tail = mid - 1;
// cout <<"head" <<head <<"tail" <<tail <<endl;
}
}
}
}
cout << C << endl;
return 0;
}
|
#include <iostream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
using namespace std;
// 常に心してかかれ
// 簡単なことを簡単にできるように練習する
int main() {
int n;
int q;
int tmp;
int C = 0;
int num_to_check;
int S[100001];
int head;
int tail;
int mid; // 中央値
stack<int> T;
cin >> n;
for (int i = 0; i < n; i++) {
scanf("%d", &S[i]);
}
/*確認
for(int i=0;i<n;i++){
cout <<S[i] <<" ";
}
cout <<endl;
*/
cin >> q;
for (int i = 0; i < q; i++) {
scanf("%d", &tmp);
T.push(tmp);
}
/*確認
while(!T.empty()){
cout <<T.top() <<" ";
T.pop();
}
cout <<endl;
*/
// 高速化用コード
int j = 1;
for (int i = 1; i < n; i++) {
if (S[i] == S[i - 1]) {
;
} else {
j++;
S[j] = S[i];
}
}
n = j + 1;
//
while (!T.empty()) {
num_to_check = T.top();
T.pop();
head = 0;
tail = n - 1;
// キーの探索
while (head <= tail) {
// 高速化用コード
if (num_to_check < S[0] || num_to_check > S[n - 1])
break;
//
if (head == tail) {
if (num_to_check == S[head /*==tail*/]) {
C++;
break;
} else {
break;
}
}
mid = (head + tail) / 2;
if (num_to_check == S[mid]) { // 見つかった(中央の値と一致)
C++;
break;
} else { // 中央の値と一致しない
if (head == tail - 1) {
if (num_to_check == S[head] || num_to_check == S[tail]) {
C++;
break;
} else {
break;
}
}
if (num_to_check > S[mid]) { // 中央の値より大きい
head = mid + 1;
// cout <<"head" <<head <<"tail" <<tail <<endl;
} else { // 中央の値より小さい
tail = mid - 1;
// cout <<"head" <<head <<"tail" <<tail <<endl;
}
}
}
}
cout << C << endl;
return 0;
}
|
replace
| 13 | 14 | 13 | 14 |
0
| |
p02268
|
C++
|
Runtime Error
|
#include <stdio.h>
#define N 10000
int S[N], T[N];
int n, m;
int binary() {
int l, r, mid, i;
int count = 0;
for (i = 0; i < m; i++) {
l = 0;
r = n;
while (l < r) {
mid = (l + r) / 2;
if (S[mid] == T[i]) {
count++;
l = r;
} else if (T[i] < S[mid]) {
r = mid;
} else {
l = mid + 1;
}
}
}
return count;
}
int main() {
scanf("%d\n", &n);
int i;
for (i = 0; i < n; i++) {
scanf("%d", &S[i]);
}
scanf("%d\n", &m);
for (i = 0; i < m; i++) {
scanf("%d", &T[i]);
}
int c = binary();
printf("%d\n", c);
return 0;
}
|
#include <stdio.h>
#define N 100000
int S[N], T[N];
int n, m;
int binary() {
int l, r, mid, i;
int count = 0;
for (i = 0; i < m; i++) {
l = 0;
r = n;
while (l < r) {
mid = (l + r) / 2;
if (S[mid] == T[i]) {
count++;
l = r;
} else if (T[i] < S[mid]) {
r = mid;
} else {
l = mid + 1;
}
}
}
return count;
}
int main() {
scanf("%d\n", &n);
int i;
for (i = 0; i < n; i++) {
scanf("%d", &S[i]);
}
scanf("%d\n", &m);
for (i = 0; i < m; i++) {
scanf("%d", &T[i]);
}
int c = binary();
printf("%d\n", c);
return 0;
}
|
replace
| 2 | 3 | 2 | 3 |
0
| |
p02268
|
Python
|
Runtime Error
|
# -*- coding: utf-8 -*-
input()
s = set(input().split())
input()
t = set(input().split())
print(int(s & t))
|
# -*- coding: utf-8 -*-
input()
s = set(input().split())
input()
t = set(input().split())
print(len(s & t))
|
replace
| 6 | 7 | 6 | 7 |
TypeError: int() argument must be a string, a bytes-like object or a real number, not 'set'
|
Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02268/Python/s343168177.py", line 7, in <module>
print(int(s & t))
TypeError: int() argument must be a string, a bytes-like object or a real number, not 'set'
|
p02268
|
Python
|
Runtime Error
|
def binarySearch(array, key):
left = 0
right = len(array)
while left < right:
mid = (left + right) / 2
if key == array[mid]:
return True
elif key > array[mid]:
left = mid + 1
elif key < array[mid]:
right = mid
else:
print("ERROR")
return False
n = int(input())
s = [int(x) for x in input().split()]
q = int(input())
t = [int(x) for x in input().split()]
a = [x for x in t if binarySearch(s, x)]
print(len(a))
|
def binarySearch(array, key):
left = 0
right = len(array)
while left < right:
mid = int((left + right) / 2)
if key == array[mid]:
return True
elif key > array[mid]:
left = mid + 1
elif key < array[mid]:
right = mid
else:
print("ERROR")
return False
n = int(input())
s = [int(x) for x in input().split()]
q = int(input())
t = [int(x) for x in input().split()]
a = [x for x in t if binarySearch(s, x)]
print(len(a))
|
replace
| 4 | 5 | 4 | 5 |
TypeError: list indices must be integers or slices, not float
|
Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02268/Python/s716545650.py", line 21, in <module>
a = [x for x in t if binarySearch(s, x)]
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02268/Python/s716545650.py", line 21, in <listcomp>
a = [x for x in t if binarySearch(s, x)]
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02268/Python/s716545650.py", line 6, in binarySearch
if key == array[mid]:
TypeError: list indices must be integers or slices, not float
|
p02268
|
C++
|
Runtime Error
|
#include <iostream>
int n, S[100000];
int search(int T) {
int l = 0, r = n;
int mid;
while (l < r) {
mid = (l + r) / 2;
if (T == S[mid])
return 1;
if (T > S[mid])
l = mid + 1;
else if (T < S[mid])
r = mid;
}
return 0;
}
int main() {
int i, q;
int T[5000];
int count = 0;
std::cin >> n;
for (int i = 0; i < n; i++) {
std::cin >> S[i];
}
std::cin >> q;
for (int i = 0; i < q; i++) {
std::cin >> T[i];
if (search(T[i])) {
count++;
}
}
std::cout << count << std::endl;
return 0;
}
|
#include <iostream>
int n, S[100000];
int search(int T) {
int l = 0, r = n;
int mid;
while (l < r) {
mid = (l + r) / 2;
if (T == S[mid])
return 1;
if (T > S[mid])
l = mid + 1;
else if (T < S[mid])
r = mid;
}
return 0;
}
int main() {
int i, q;
int T[50000];
int count = 0;
std::cin >> n;
for (int i = 0; i < n; i++) {
std::cin >> S[i];
}
std::cin >> q;
for (int i = 0; i < q; i++) {
std::cin >> T[i];
if (search(T[i])) {
count++;
}
}
std::cout << count << std::endl;
return 0;
}
|
replace
| 22 | 23 | 22 | 23 |
0
| |
p02268
|
C++
|
Time Limit Exceeded
|
#include <iostream>
using namespace std;
int main() {
int n, q;
cin >> n;
int S[n];
for (int i = 0; i < n; i++)
cin >> S[i];
cin >> q;
int T[q];
for (int i = 0; i < q; i++)
cin >> T[i];
int x = 0;
int mid;
int left = 0;
int right = n;
for (int j = 0; j < q; j++) {
left = 0;
right = n;
while (left < right) {
mid = (left + right) / 2;
if (S[mid] == T[j]) {
x++;
break;
} else if (T[j] < S[mid]) {
right = mid;
} else if (T[j] > S[mid]) {
left = mid;
}
}
}
cout << x << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int n, q;
cin >> n;
int S[n];
for (int i = 0; i < n; i++)
cin >> S[i];
cin >> q;
int T[q];
for (int i = 0; i < q; i++)
cin >> T[i];
int x = 0;
int mid;
int left = 0;
int right = n;
for (int j = 0; j < q; j++) {
left = 0;
right = n;
while (left < right) {
mid = (left + right) / 2;
if (S[mid] == T[j]) {
x++;
break;
} else if (T[j] < S[mid]) {
right = mid;
} else if (T[j] > S[mid]) {
left = mid + 1;
}
}
}
cout << x << endl;
return 0;
}
|
replace
| 29 | 30 | 29 | 30 |
TLE
| |
p02268
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a[10000], b, c[10000], i, k = 0, j;
for (cin >> n, i = 0; i < n; i++)
cin >> a[i];
for (cin >> b, i = 0; i < b; i++)
cin >> c[i];
for (i = 0; i < b; i++)
if (binary_search(a, a + n, c[i]))
k++;
cout << k << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, a[100000], b, c[50000], i, k = 0, j;
for (cin >> n, i = 0; i < n; i++)
cin >> a[i];
for (cin >> b, i = 0; i < b; i++)
cin >> c[i];
for (i = 0; i < b; i++)
if (binary_search(a, a + n, c[i]))
k++;
cout << k << endl;
}
|
replace
| 3 | 4 | 3 | 4 |
0
| |
p02268
|
C++
|
Runtime Error
|
#include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int A[10000], n;
int Search(int key) {
int l = 0;
int r = n;
int m;
while (l < r) {
m = (l + r) / 2;
if (A[m] < key)
l = m + 1;
if (A[m] > key)
r = m;
else if (A[m] == key)
return 1;
}
return 0;
}
int main() {
int q, k, s = 0;
cin >> n;
for (int i = 0; i < n; i++)
cin >> A[i];
cin >> q;
for (int i = 0; i < q; i++) {
cin >> k;
if (Search(k))
s++;
}
cout << s << "\n";
return 0;
}
|
#include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int A[100000], n;
int Search(int key) {
int l = 0;
int r = n;
int m;
while (l < r) {
m = (l + r) / 2;
if (A[m] < key)
l = m + 1;
if (A[m] > key)
r = m;
else if (A[m] == key)
return 1;
}
return 0;
}
int main() {
int q, k, s = 0;
cin >> n;
for (int i = 0; i < n; i++)
cin >> A[i];
cin >> q;
for (int i = 0; i < q; i++) {
cin >> k;
if (Search(k))
s++;
}
cout << s << "\n";
return 0;
}
|
replace
| 5 | 6 | 5 | 6 |
0
| |
p02268
|
C++
|
Runtime Error
|
// 含有标记的线性搜索可以将算法效率提高常数倍
// for(int i=0;i<n;i++)
// s[n]==key;while(s[i]!=key)i++;if(i!=n)
// 区别在于主循环中比较运算的次数
#include <cstdio>
#include <iostream>
using namespace std;
int s[10004];
int cnt, n;
/*void LinearSearch(int s[],int num)
{
for(int i=0;i<n;i++)
{
if(s[i]==num)
{
cnt++;
break;
}
}
}*/
int BinarySearch(int key) {
int left = 0;
int right = n;
while (left < right) {
int mid = (left + right) / 2;
if (s[mid] == key) {
// cout<<"1"<<endl;
return 1;
} else if (key < s[mid]) // 前半部分
{
right = mid;
} else // 后半部分
{
left = mid + 1;
}
}
return 0;
}
int main() {
scanf("%d", &n);
for (int k = 0; k < n; k++) {
scanf("%d", &s[k]);
// cin>>s[k];
}
int q;
scanf("%d", &q);
while (q--) {
int nn;
// cin>>nn;
scanf("%d", &nn);
if (BinarySearch(nn)) {
cnt++;
// cout<<nn<<endl;
}
}
cout << cnt << endl;
return 0;
}
|
// 含有标记的线性搜索可以将算法效率提高常数倍
// for(int i=0;i<n;i++)
// s[n]==key;while(s[i]!=key)i++;if(i!=n)
// 区别在于主循环中比较运算的次数
#include <cstdio>
#include <iostream>
using namespace std;
int s[100005];
int cnt, n;
/*void LinearSearch(int s[],int num)
{
for(int i=0;i<n;i++)
{
if(s[i]==num)
{
cnt++;
break;
}
}
}*/
int BinarySearch(int key) {
int left = 0;
int right = n;
while (left < right) {
int mid = (left + right) / 2;
if (s[mid] == key) {
// cout<<"1"<<endl;
return 1;
} else if (key < s[mid]) // 前半部分
{
right = mid;
} else // 后半部分
{
left = mid + 1;
}
}
return 0;
}
int main() {
scanf("%d", &n);
for (int k = 0; k < n; k++) {
scanf("%d", &s[k]);
// cin>>s[k];
}
int q;
scanf("%d", &q);
while (q--) {
int nn;
// cin>>nn;
scanf("%d", &nn);
if (BinarySearch(nn)) {
cnt++;
// cout<<nn<<endl;
}
}
cout << cnt << endl;
return 0;
}
|
replace
| 7 | 8 | 7 | 8 |
0
| |
p02268
|
C++
|
Runtime Error
|
#include <iostream>
#include <string>
#include <vector>
using namespace std;
bool binSearch(int *s, int n, int target) {
int lo = 0;
int hi = n - 1;
while (lo <= hi) {
int mid = lo + (hi - lo) / 2;
if (s[mid] == target)
return true;
else if (target > s[mid])
lo = mid + 1;
else
hi = mid - 1;
}
return false;
}
int main() {
int val, n, q;
int s[10000], t[500];
cin >> n;
for (int i = 0; i < n && cin >> val; ++i)
s[i] = val;
int count = 0;
cin >> q;
while (q--) {
cin >> val;
if (binSearch(s, n, val))
count++;
}
cout << count << endl;
return 0;
}
|
#include <iostream>
#include <string>
#include <vector>
using namespace std;
bool binSearch(int *s, int n, int target) {
int lo = 0;
int hi = n - 1;
while (lo <= hi) {
int mid = lo + (hi - lo) / 2;
if (s[mid] == target)
return true;
else if (target > s[mid])
lo = mid + 1;
else
hi = mid - 1;
}
return false;
}
int main() {
int val, n, q;
int s[100000], t[50000];
cin >> n;
for (int i = 0; i < n && cin >> val; ++i)
s[i] = val;
int count = 0;
cin >> q;
while (q--) {
cin >> val;
if (binSearch(s, n, val))
count++;
}
cout << count << endl;
return 0;
}
|
replace
| 23 | 24 | 23 | 24 |
0
| |
p02268
|
C++
|
Runtime Error
|
#include <iostream>
#include <algorithm>
#include <cmath>
using namespace std;
int S[10010];
int s, q;
bool binarySearch(int A[], int key) {
int left = 0;
int right = s - 1;
int mid;
while (left <= right) {
mid = (left + right) / 2;
if (A[mid] > key) {
right = mid - 1;
} else if (A[mid] < key) {
left = mid + 1;
} else {
return true;
}
}
return false;
}
int main() {
cin >> s;
for (int i = 0; i < s; i++) {
cin >> S[i];
}
int count = 0;
int temp;
cin >> q;
for (int i = 0; i < q; i++) {
cin >> temp;
if (binarySearch(S, temp)) {
count++;
}
}
cout << count << endl;
return 0;
}
|
#include <iostream>
#include <algorithm>
#include <cmath>
using namespace std;
int S[100100];
int s, q;
bool binarySearch(int A[], int key) {
int left = 0;
int right = s - 1;
int mid;
while (left <= right) {
mid = (left + right) / 2;
if (A[mid] > key) {
right = mid - 1;
} else if (A[mid] < key) {
left = mid + 1;
} else {
return true;
}
}
return false;
}
int main() {
cin >> s;
for (int i = 0; i < s; i++) {
cin >> S[i];
}
int count = 0;
int temp;
cin >> q;
for (int i = 0; i < q; i++) {
cin >> temp;
if (binarySearch(S, temp)) {
count++;
}
}
cout << count << endl;
return 0;
}
|
replace
| 7 | 8 | 7 | 8 |
0
| |
p02268
|
C++
|
Runtime Error
|
#include <iostream>
#include <stdio.h>
using namespace std;
int n, S[10000 + 1];
bool binarySearch(int key) {
int left = 0, right = n - 1, mid;
while (left <= right) {
mid = (left + right) / 2;
// printf("L, R, M, S[mid]: %d %d %d %d\n", left, right, mid, S[mid]);
if (key == S[mid])
return true;
else if (key < S[mid])
right = mid - 1;
else
left = mid + 1;
}
return false;
}
int main() {
int q, key, count = 0;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &S[i]);
}
scanf("%d", &q);
for (int i = 0; i < q; i++) {
scanf("%d", &key);
if (binarySearch(key))
count++;
}
printf("%d\n", count);
return 0;
}
|
#include <iostream>
#include <stdio.h>
using namespace std;
int n, S[100000 + 1];
bool binarySearch(int key) {
int left = 0, right = n - 1, mid;
while (left <= right) {
mid = (left + right) / 2;
// printf("L, R, M, S[mid]: %d %d %d %d\n", left, right, mid, S[mid]);
if (key == S[mid])
return true;
else if (key < S[mid])
right = mid - 1;
else
left = mid + 1;
}
return false;
}
int main() {
int q, key, count = 0;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &S[i]);
}
scanf("%d", &q);
for (int i = 0; i < q; i++) {
scanf("%d", &key);
if (binarySearch(key))
count++;
}
printf("%d\n", count);
return 0;
}
|
replace
| 4 | 5 | 4 | 5 |
0
| |
p02268
|
C++
|
Runtime Error
|
#include <iostream>
#include <vector>
using namespace std;
// returns the index of the element which value equals to key.
// if no elements matched, it returns -1.
int search(const vector<int> &x, int key) {
int left = 0, right = x.size();
while (left < right) {
int mid = (left + right) / 2;
if (x[mid] == key) {
return mid;
} else if (key < x[mid]) {
right = mid;
} else if (x[mid] < key) {
left = mid + 1;
}
}
return -1;
}
int main() {
int n;
cin >> n;
vector<int> na(0, n);
for (int i = 0; i < n; i++)
cin >> na[i];
int q;
cin >> q;
int t;
int ans = 0;
for (int i = 0; i < q; ++i) {
cin >> t;
ans += search(na, t) >= 0 ? 1 : 0;
}
cout << ans << endl;
return 0;
}
|
#include <iostream>
#include <vector>
using namespace std;
// returns the index of the element which value equals to key.
// if no elements matched, it returns -1.
int search(const vector<int> &x, int key) {
int left = 0, right = x.size();
while (left < right) {
int mid = (left + right) / 2;
if (x[mid] == key) {
return mid;
} else if (key < x[mid]) {
right = mid;
} else if (x[mid] < key) {
left = mid + 1;
}
}
return -1;
}
int main() {
int n;
cin >> n;
vector<int> na(n, 0);
for (int i = 0; i < n; i++)
cin >> na[i];
int q;
cin >> q;
int t;
int ans = 0;
for (int i = 0; i < q; ++i) {
cin >> t;
ans += search(na, t) >= 0 ? 1 : 0;
}
cout << ans << endl;
return 0;
}
|
replace
| 24 | 25 | 24 | 25 |
-11
| |
p02268
|
C++
|
Time Limit Exceeded
|
//
// main.cpp
// binary_search
//
// Created by ???????????? on 2017/10/06.
// Copyright ?? 2017 ????????????. All rights reserved.
//
#include <iostream>
#include <stdio.h>
using namespace std;
bool binary_search(int A[], int n, int key) {
int left, mid, right;
left = 0;
right = n;
while (left < right) {
mid = (left + right) / 2;
if (A[mid] == key) {
return true;
} else if (key < A[mid]) {
right = mid;
} else if (key > A[mid]) {
left = mid;
}
}
return false;
}
int main(int argc, const char *argv[]) {
int n, i, ct, q, key;
scanf("%d", &n);
int S[n];
for (i = 0; i < n; i++) {
scanf("%d", &S[i]);
}
ct = 0;
scanf("%d", &q);
for (i = 0; i < q; i++) {
scanf("%d", &key);
bool found = binary_search(S, n, key);
if (found)
ct++;
}
cout << ct << endl;
;
return 0;
}
|
//
// main.cpp
// binary_search
//
// Created by ???????????? on 2017/10/06.
// Copyright ?? 2017 ????????????. All rights reserved.
//
#include <iostream>
#include <stdio.h>
using namespace std;
bool binary_search(int A[], int n, int key) {
int left, mid, right;
left = 0;
right = n;
while (left < right) {
mid = (left + right) / 2;
if (A[mid] == key) {
return true;
} else if (key < A[mid]) {
right = mid;
} else if (key > A[mid]) {
left = mid + 1;
}
}
return false;
}
int main(int argc, const char *argv[]) {
int n, i, ct, q, key;
scanf("%d", &n);
int S[n];
for (i = 0; i < n; i++) {
scanf("%d", &S[i]);
}
ct = 0;
scanf("%d", &q);
for (i = 0; i < q; i++) {
scanf("%d", &key);
bool found = binary_search(S, n, key);
if (found)
ct++;
}
cout << ct << endl;
;
return 0;
}
|
replace
| 24 | 25 | 24 | 25 |
TLE
| |
p02268
|
C++
|
Time Limit Exceeded
|
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define all(c) (c).begin(), (c).end()
#define rep(i, n) for (int i = 0; i < (n); i++)
#define pb(e) push_back(e)
#define mp(a, b) make_pair(a, b)
#define fr first
#define sc second
const int INF = 100000000;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
bool binary_search(int *a, int n, int x) {
int l = 0, r = n;
while (r - l > 0) {
int mid = (l + r) / 2;
if (a[mid] < x)
l = mid;
else if (a[mid] == x)
return true;
else
r = mid;
}
// cout<<l<<","<<r<<endl;
return false;
}
int n;
int S[100005];
int q;
int main() {
int ans = 0;
cin >> n;
rep(i, n) cin >> S[i];
cin >> q;
rep(i, q) {
int t;
cin >> t;
if (binary_search(S, n, t))
ans++;
}
cout << ans << endl;
return 0;
}
|
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define all(c) (c).begin(), (c).end()
#define rep(i, n) for (int i = 0; i < (n); i++)
#define pb(e) push_back(e)
#define mp(a, b) make_pair(a, b)
#define fr first
#define sc second
const int INF = 100000000;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
bool binary_search(int *a, int n, int x) {
int l = 0, r = n;
while (r - l > 0) {
int mid = (l + r) / 2;
if (a[mid] < x)
l = mid + 1;
else if (a[mid] == x)
return true;
else
r = mid;
}
// cout<<l<<","<<r<<endl;
return false;
}
int n;
int S[100005];
int q;
int main() {
int ans = 0;
cin >> n;
rep(i, n) cin >> S[i];
cin >> q;
rep(i, q) {
int t;
cin >> t;
if (binary_search(S, n, t))
ans++;
}
cout << ans << endl;
return 0;
}
|
replace
| 38 | 39 | 38 | 39 |
TLE
| |
p02268
|
C++
|
Time Limit Exceeded
|
#include <stdio.h>
int main(void) {
int n, S[10000], i, j, q, T[500], t, C, L, R, M;
scanf("%d", &n);
for (i = 0; i != n; i++) {
scanf("%d", &S[i]);
}
scanf("%d", &q);
for (j = 0; j != q; j++) {
scanf("%d", &T[j]);
}
C = 0;
for (i = 0; i != q; i++) {
L = 0;
R = n;
while (L < R) {
M = (L + R) / 2;
if (S[M] == T[i]) {
C++;
break;
}
if (S[M] > T[i]) {
R = M;
} else {
L = M + 1;
}
}
}
printf("%d\n", C);
return 0;
}
|
#include <stdio.h>
int main(void) {
int n, S[100000], i, j, q, T[50000], t, C, L, R, M;
scanf("%d", &n);
for (i = 0; i != n; i++) {
scanf("%d", &S[i]);
}
scanf("%d", &q);
for (j = 0; j != q; j++) {
scanf("%d", &T[j]);
}
C = 0;
for (i = 0; i != q; i++) {
L = 0;
R = n;
while (L < R) {
M = (L + R) / 2;
if (S[M] == T[i]) {
C++;
break;
}
if (S[M] > T[i]) {
R = M;
} else {
L = M + 1;
}
}
}
printf("%d\n", C);
return 0;
}
|
replace
| 2 | 3 | 2 | 3 |
TLE
| |
p02268
|
C++
|
Time Limit Exceeded
|
#include <iostream>
using namespace std;
bool binSearch(int A[], int target, int size) {
int left = 0, right = size - 1, mid;
while (left <= right) {
mid = (left + right) / 2;
// cout << "left : " << left << ", right : " << right << ", mid : " << mid
// << endl;
if (A[mid] == target) {
// cout << target << " found." << endl;
return true;
} else {
if (A[mid] < target)
left = mid + 1;
else
right = mid;
}
}
return false;
}
int main() {
int size, query, queryNum, count = 0;
cin >> size;
int *A = new int[size];
for (int i = 0; i < size; i++)
scanf("%d", &A[i]);
cin >> queryNum;
for (int i = 0; i < queryNum; i++) {
scanf("%d", &query);
if (binSearch(A, query, size))
count++;
}
cout << count << endl;
delete[] A;
}
|
#include <iostream>
using namespace std;
bool binSearch(int A[], int target, int size) {
int left = 0, right = size, mid;
while (left < right) {
mid = (left + right) / 2;
// cout << "left : " << left << ", right : " << right << ", mid : " << mid
// << endl;
if (A[mid] == target) {
// cout << target << " found." << endl;
return true;
} else {
if (A[mid] < target)
left = mid + 1;
else
right = mid;
}
}
return false;
}
int main() {
int size, query, queryNum, count = 0;
cin >> size;
int *A = new int[size];
for (int i = 0; i < size; i++)
scanf("%d", &A[i]);
cin >> queryNum;
for (int i = 0; i < queryNum; i++) {
scanf("%d", &query);
if (binSearch(A, query, size))
count++;
}
cout << count << endl;
delete[] A;
}
|
replace
| 4 | 6 | 4 | 6 |
TLE
| |
p02268
|
C++
|
Runtime Error
|
#include <algorithm>
#include <cstdlib>
#include <iostream>
#include <stack>
#include <stdio.h>
#include <string>
int binarysearch(int a[], int n, int key) {
int left = 0;
int right = n;
int mid;
while (left < right) {
mid = (left + right) / 2;
if (key == a[mid])
return 1;
if (key > a[mid])
left = mid + 1;
else if (key < a[mid])
right = mid;
}
return 0;
}
using namespace std;
int main() {
int i, n, a[10001], q, key, sum = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
scanf("%d", &q);
for (i = 0; i < q; i++) {
scanf("%d", &key);
if (binarysearch(a, n, key))
sum++;
}
printf("%d\n", sum);
return 0;
}
|
#include <algorithm>
#include <cstdlib>
#include <iostream>
#include <stack>
#include <stdio.h>
#include <string>
int binarysearch(int a[], int n, int key) {
int left = 0;
int right = n;
int mid;
while (left < right) {
mid = (left + right) / 2;
if (key == a[mid])
return 1;
if (key > a[mid])
left = mid + 1;
else if (key < a[mid])
right = mid;
}
return 0;
}
using namespace std;
int main() {
int i, n, a[100001], q, key, sum = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
scanf("%d", &q);
for (i = 0; i < q; i++) {
scanf("%d", &key);
if (binarysearch(a, n, key))
sum++;
}
printf("%d\n", sum);
return 0;
}
|
replace
| 24 | 25 | 24 | 25 |
0
| |
p02268
|
C++
|
Time Limit Exceeded
|
#include <iostream>
using namespace std;
int main() {
int n, s[100000], q, t[50000], i, j, l, r, m, count = 0;
cin >> n;
for (i = 0; i < n; i++) {
cin >> s[i];
}
cin >> q;
for (i = 0; i < q; i++) {
cin >> t[i];
}
// Binary Search
for (i = 0; i < q; i++) {
l = 0;
r = n;
while (l < r) {
m = (l + r) / 2;
if (s[m] > t[i]) {
r = m;
} else if (s[m] < t[i]) {
l = m;
} else {
count++;
break;
}
}
}
cout << count << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int n, s[100000], q, t[50000], i, j, l, r, m, count = 0;
cin >> n;
for (i = 0; i < n; i++) {
cin >> s[i];
}
cin >> q;
for (i = 0; i < q; i++) {
cin >> t[i];
}
// Binary Search
for (i = 0; i < q; i++) {
l = 0;
r = n;
while (l < r) {
m = (l + r) / 2;
if (s[m] > t[i]) {
r = m;
} else if (s[m] < t[i]) {
l = m + 1;
} else {
count++;
break;
}
}
}
cout << count << endl;
return 0;
}
|
replace
| 24 | 25 | 24 | 25 |
TLE
| |
p02268
|
C++
|
Runtime Error
|
#include <stdio.h>
int A[1000000], n;
int binarySearch(int key) {
int left = 0;
int right = n;
int mid;
while (left < right) {
mid = (left + right) / 2;
if (A[mid] == key)
return 1;
if (key < A[mid])
right = mid;
else if (key > A[mid])
left = mid + 1;
}
return 0;
}
int main() {
int i, q, key, sum = 0;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", A[i]);
}
scanf("%d", &q);
for (int i = 0; i < q; i++) {
scanf("%d", &key);
if (binarySearch(key))
sum++;
}
printf("%d\n", sum);
return 0;
}
|
#include <stdio.h>
int A[1000000], n;
int binarySearch(int key) {
int left = 0;
int right = n;
int mid;
while (left < right) {
mid = (left + right) / 2;
if (A[mid] == key)
return 1;
if (key < A[mid])
right = mid;
else if (key > A[mid])
left = mid + 1;
}
return 0;
}
int main() {
int i, q, key, sum = 0;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
scanf("%d", &q);
for (int i = 0; i < q; i++) {
scanf("%d", &key);
if (binarySearch(key))
sum++;
}
printf("%d\n", sum);
return 0;
}
|
replace
| 25 | 26 | 25 | 26 |
-11
| |
p02268
|
C++
|
Runtime Error
|
#include <stdio.h>
int A[1000000], n;
int binarySearch(int key) {
int left = 0;
int right = n;
int mid;
while (left < right) {
mid = (left + right) / 2;
if (A[mid] == key)
return 1;
if (key < A[mid])
right = mid;
else if (key > A[mid])
left = mid + 1;
}
return 0;
}
int main() {
int i, q, key, sum = 0;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", A[i]);
}
scanf("%d", &q);
for (int i = 0; i < q; i++) {
scanf("%d", &key);
if (binarySearch(key))
sum++;
}
printf("%d\n", sum);
return 0;
}
|
#include <stdio.h>
int A[1000000], n;
int binarySearch(int key) {
int left = 0;
int right = n;
int mid;
while (left < right) {
mid = (left + right) / 2;
if (A[mid] == key)
return 1;
if (key < A[mid])
right = mid;
else if (key > A[mid])
left = mid + 1;
}
return 0;
}
int main() {
int i, q, key, sum = 0;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
scanf("%d", &q);
for (int i = 0; i < q; i++) {
scanf("%d", &key);
if (binarySearch(key))
sum++;
}
printf("%d\n", sum);
return 0;
}
|
replace
| 25 | 26 | 25 | 26 |
-11
| |
p02268
|
C++
|
Time Limit Exceeded
|
#include <algorithm>
#include <cmath>
#include <iostream>
#define int long long
using namespace std;
int S[100100];
int n, q;
int T;
signed main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> S[i];
}
cin >> q;
int L = 0;
int R = n;
int cnt = 0;
int mid;
for (int i = 0; i < q; i++) {
cin >> T;
L = 0;
R = n;
for (int j = 0; j < n / 2; j++) {
int mid = (L + R) / 2;
// cout<<mid<<endl;
if (S[L] == T) {
cnt++;
// cout<<"succes"<<endl;
break;
} else if (S[mid] <= T) {
L = mid;
} else if (S[mid] > T) {
R = mid;
}
}
}
cout << cnt << endl;
return 0;
}
|
#include <algorithm>
#include <cmath>
#include <iostream>
#define int long long
using namespace std;
int S[100100];
int n, q;
int T;
signed main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> S[i];
}
cin >> q;
int L = 0;
int R = n;
int cnt = 0;
int mid;
for (int i = 0; i < q; i++) {
cin >> T;
L = 0;
R = n;
for (int j = 0; j < 18; j++) {
int mid = (L + R) / 2;
// cout<<mid<<endl;
if (S[L] == T) {
cnt++;
// cout<<"succes"<<endl;
break;
} else if (S[mid] <= T) {
L = mid;
} else if (S[mid] > T) {
R = mid;
}
}
}
cout << cnt << endl;
return 0;
}
|
replace
| 25 | 26 | 25 | 26 |
TLE
| |
p02268
|
C++
|
Time Limit Exceeded
|
#include <iostream>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
ios_base::sync_with_stdio(false);
unsigned int list[100000];
int numOfList;
cin >> numOfList;
rep(i, numOfList) cin >> list[i];
int val;
int counter = 0;
cin >> val;
while (cin >> val) {
int high = numOfList - 1;
int low = 0;
int mid;
while (low <= high) {
if (list[mid] < val) {
low = mid + 1;
} else if (list[mid] > val) {
high = mid - 1;
} else if (list[mid] == val) {
counter++;
break;
}
}
}
cout << counter << endl;
return 0;
}
|
#include <iostream>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
ios_base::sync_with_stdio(false);
unsigned int list[100000];
int numOfList;
cin >> numOfList;
rep(i, numOfList) cin >> list[i];
int val;
int counter = 0;
cin >> val;
while (cin >> val) {
int high = numOfList - 1;
int low = 0;
int mid;
while (low <= high) {
mid = (low + high) / 2;
if (list[mid] < val) {
low = mid + 1;
} else if (list[mid] > val) {
high = mid - 1;
} else if (list[mid] == val) {
counter++;
break;
}
}
}
cout << counter << endl;
return 0;
}
|
insert
| 24 | 24 | 24 | 25 |
TLE
| |
p02268
|
C++
|
Runtime Error
|
#include <cstdio>
#include <iostream>
using namespace std;
// ?????§????´¢
bool BinarySearch(int A[], int n, int key) {
int left = 0, right = n, mid;
while (left < right) {
mid = (left + right) / 2;
if (key == A[mid])
return true;
if (key > A[mid])
left = mid + 1;
if (key < A[mid])
right = mid;
}
return false;
}
int main() {
int n, q, key;
int sum = 0;
int A[10000 + 10];
scanf("%d", &n);
for (int i = 0; i < n; i++)
scanf("%d", &A[i]);
scanf("%d", &q);
for (int i = 0; i < q; i++) {
scanf("%d", &key);
if (BinarySearch(A, n, key))
sum++;
}
printf("%d\n", sum);
}
|
#include <cstdio>
#include <iostream>
using namespace std;
// ?????§????´¢
bool BinarySearch(int A[], int n, int key) {
int left = 0, right = n, mid;
while (left < right) {
mid = (left + right) / 2;
if (key == A[mid])
return true;
if (key > A[mid])
left = mid + 1;
if (key < A[mid])
right = mid;
}
return false;
}
int main() {
int n, q, key;
int sum = 0;
int A[100000 + 10];
scanf("%d", &n);
for (int i = 0; i < n; i++)
scanf("%d", &A[i]);
scanf("%d", &q);
for (int i = 0; i < q; i++) {
scanf("%d", &key);
if (BinarySearch(A, n, key))
sum++;
}
printf("%d\n", sum);
}
|
replace
| 23 | 24 | 23 | 24 |
0
| |
p02268
|
C++
|
Time Limit Exceeded
|
#include <algorithm>
#include <iostream>
#include <string>
using namespace std;
constexpr int Nmax = 100'000;
bool binarySearch(int *array, int value, int n) {
int left = 0;
int right = n - 1;
int center = (left + right) / 2;
while (array[center] != value) {
if (left == right) {
return false;
}
if (array[center] > value) {
right = center - 1;
} else {
left = center + 1;
}
center = (left + right) / 2;
}
return true;
}
int main() {
ios::sync_with_stdio(false);
int same = 0;
int S[Nmax];
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> S[i];
}
int q;
cin >> q;
for (int i = 0; i < q; i++) {
int value;
cin >> value;
if (binarySearch(S, value, n)) {
same++;
}
}
cout << same << endl;
return 0;
}
|
#include <algorithm>
#include <iostream>
#include <string>
using namespace std;
constexpr int Nmax = 100'000;
bool binarySearch(int *array, int value, int n) {
int left = 0;
int right = n - 1;
int center = (left + right) / 2;
while (array[center] != value) {
if (left >= right) {
return false;
}
if (array[center] > value) {
right = center - 1;
} else {
left = center + 1;
}
center = (left + right) / 2;
}
return true;
}
int main() {
ios::sync_with_stdio(false);
int same = 0;
int S[Nmax];
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> S[i];
}
int q;
cin >> q;
for (int i = 0; i < q; i++) {
int value;
cin >> value;
if (binarySearch(S, value, n)) {
same++;
}
}
cout << same << endl;
return 0;
}
|
replace
| 13 | 14 | 13 | 14 |
TLE
| |
p02268
|
C++
|
Time Limit Exceeded
|
#include <iostream>
using namespace std;
int ans = 0;
bool answer(int n, long num[], int p) {
if (n == num[p]) {
ans++;
return true;
}
return false;
}
int main() {
int s, t, n;
cin >> s;
long num[s];
for (int i = 0; i < s; i++)
cin >> num[i];
cin >> t;
for (int i = 0; i < t; i++) {
int p = 0, pp = s;
bool br = false;
cin >> n;
while (true) {
int a = p + ((pp - p) / 2);
if (answer(n, num, a))
break;
else if (n > num[a]) {
if (answer(n, num, a + 1))
break;
p = a;
if (p >= s)
break;
} else if (answer(n, num, a - 1))
break;
else {
pp = a - 2;
if (pp <= p)
break;
}
}
}
cout << ans << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int ans = 0;
bool answer(int n, long num[], int p) {
if (n == num[p]) {
ans++;
return true;
}
return false;
}
int main() {
int s, t, n;
cin >> s;
long num[s];
for (int i = 0; i < s; i++)
cin >> num[i];
cin >> t;
for (int i = 0; i < t; i++) {
int p = 0, pp = s;
bool br = false;
cin >> n;
while (true) {
int a = p + ((pp - p) / 2);
if (answer(n, num, a))
break;
else if (n > num[a]) {
if (answer(n, num, a + 1))
break;
p = a + 1;
if (p == pp)
break;
} else if (answer(n, num, a - 1))
break;
else {
pp = a - 2;
if (pp <= p)
break;
}
}
}
cout << ans << endl;
return 0;
}
|
replace
| 35 | 37 | 35 | 37 |
TLE
| |
p02268
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, q;
long long S[10000], T;
cin >> n;
for (int i = 0; i < n; i++)
cin >> S[i];
cin >> q;
int count = 0;
for (int j = 0; j < q; j++) {
cin >> T;
int left = 0;
int right = n;
int mid = (left + right) / 2;
while (left < right) {
mid = (left + right) / 2;
if (T == S[mid]) {
count++;
break;
}
if (T > S[mid]) {
left = mid + 1;
} else if (T < S[mid]) {
right = mid;
}
}
}
cout << count << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, q;
long long S[1000000], T;
cin >> n;
for (int i = 0; i < n; i++)
cin >> S[i];
cin >> q;
int count = 0;
for (int j = 0; j < q; j++) {
cin >> T;
int left = 0;
int right = n;
int mid = (left + right) / 2;
while (left < right) {
mid = (left + right) / 2;
if (T == S[mid]) {
count++;
break;
}
if (T > S[mid]) {
left = mid + 1;
} else if (T < S[mid]) {
right = mid;
}
}
}
cout << count << endl;
return 0;
}
|
replace
| 7 | 8 | 7 | 8 |
0
| |
p02268
|
C++
|
Runtime Error
|
#include <algorithm>
#include <cstdio>
static const size_t n_max = 10000;
static int S[n_max];
int main() {
size_t n, q;
scanf("%zu", &n);
for (size_t i = 0; i < n; i++)
scanf("%d", S + i);
scanf("%zu", &q);
int c = 0;
for (size_t i = 0; i < q; i++) {
int t;
scanf("%d", &t);
if (std::binary_search(S, S + n, t))
c++;
}
printf("%d\n", c);
return 0;
}
|
#include <algorithm>
#include <cstdio>
static const size_t n_max = 100000;
static int S[n_max];
int main() {
size_t n, q;
scanf("%zu", &n);
for (size_t i = 0; i < n; i++)
scanf("%d", S + i);
scanf("%zu", &q);
int c = 0;
for (size_t i = 0; i < q; i++) {
int t;
scanf("%d", &t);
if (std::binary_search(S, S + n, t))
c++;
}
printf("%d\n", c);
return 0;
}
|
replace
| 3 | 4 | 3 | 4 |
0
| |
p02268
|
C++
|
Time Limit Exceeded
|
#include <cstdio>
int A[1000000], n;
int binarySearch(int key) {
int left = 0, right = n, mid;
while (left < right) {
mid = (left + right) / 2;
if (key == A[mid])
return 1;
else if (key < A[mid])
right = mid;
else if (key > A[mid])
left = mid;
}
return 0;
}
int main() {
int q, k, sum = 0;
scanf("%d", &n);
for (int i = 0; i < n; i++)
scanf("%d", &A[i]);
scanf("%d", &q);
for (int i = 0; i < q; i++) {
scanf("%d", &k);
if (binarySearch(k))
sum++;
}
printf("%d\n", sum);
}
|
#include <cstdio>
int A[1000000], n;
int binarySearch(int key) {
int left = 0, right = n, mid;
while (left < right) {
mid = (left + right) / 2;
if (key == A[mid])
return 1;
else if (key < A[mid])
right = mid;
else if (key > A[mid])
left = mid + 1;
}
return 0;
}
int main() {
int q, k, sum = 0;
scanf("%d", &n);
for (int i = 0; i < n; i++)
scanf("%d", &A[i]);
scanf("%d", &q);
for (int i = 0; i < q; i++) {
scanf("%d", &k);
if (binarySearch(k))
sum++;
}
printf("%d\n", sum);
}
|
replace
| 14 | 15 | 14 | 15 |
TLE
| |
p02268
|
C++
|
Runtime Error
|
#include <stdio.h>
int main() {
int i, n, j, k, o, count = 0;
int a[10001];
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &a[i]);
int left = 0, right = n - 1;
int cur = n / 2;
scanf("%d", &k);
for (i = 0; i < k; i++) {
scanf("%d", &o);
left = 0, right = n - 1;
while (1) {
if (left == right - 1 || left == right) {
if (a[left] == o || a[right] == o)
count++;
break;
}
if (o == a[cur] || o == a[cur + 1]) {
count++;
break;
}
if (o > a[cur]) {
left = cur;
cur = (left + right) / 2;
}
if (o < a[cur]) {
right = cur;
cur = (left + right) / 2;
}
}
}
printf("%d\n", count);
}
|
#include <stdio.h>
int main() {
int i, n, j, k, o, count = 0;
int a[1000001];
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &a[i]);
int left = 0, right = n - 1;
int cur = n / 2;
scanf("%d", &k);
for (i = 0; i < k; i++) {
scanf("%d", &o);
left = 0, right = n - 1;
while (1) {
if (left == right - 1 || left == right) {
if (a[left] == o || a[right] == o)
count++;
break;
}
if (o == a[cur] || o == a[cur + 1]) {
count++;
break;
}
if (o > a[cur]) {
left = cur;
cur = (left + right) / 2;
}
if (o < a[cur]) {
right = cur;
cur = (left + right) / 2;
}
}
}
printf("%d\n", count);
}
|
replace
| 3 | 4 | 3 | 4 |
0
| |
p02268
|
C++
|
Runtime Error
|
#include <cstdio>
int main(int argc, char const *argv[]) {
int n, q, target;
int findCount = 0; // ???????????£?????°????????°
int inputSequence[10000];
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &inputSequence[i]);
}
scanf("%d", &q);
for (int i = 0; i < q; i++) {
scanf("%d", &target);
int begin = 0, end = n - 1;
do {
int current = (begin + end) / 2;
if (inputSequence[current] == target) {
findCount++;
break;
}
// ?????????????????§????????????????????????
else if (inputSequence[current] < target) {
begin = current + 1;
}
// ????????????????°?????????????????????????
else if (inputSequence[current] > target) {
end = current - 1;
}
} while (begin <= end); // ????????¨????°??????\???????????£????????????
}
printf("%d\n", findCount);
return 0;
}
|
#include <cstdio>
int main(int argc, char const *argv[]) {
int n, q, target;
int findCount = 0; // ???????????£?????°????????°
int inputSequence[100000];
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &inputSequence[i]);
}
scanf("%d", &q);
for (int i = 0; i < q; i++) {
scanf("%d", &target);
int begin = 0, end = n - 1;
do {
int current = (begin + end) / 2;
if (inputSequence[current] == target) {
findCount++;
break;
}
// ?????????????????§????????????????????????
else if (inputSequence[current] < target) {
begin = current + 1;
}
// ????????????????°?????????????????????????
else if (inputSequence[current] > target) {
end = current - 1;
}
} while (begin <= end); // ????????¨????°??????\???????????£????????????
}
printf("%d\n", findCount);
return 0;
}
|
replace
| 5 | 6 | 5 | 6 |
0
| |
p02268
|
C++
|
Runtime Error
|
#include <iostream>
using namespace std;
int main() {
int n, a[10000], m, b, result = 0, i, j;
cin >> n;
for (i = 0; i < n; i++)
cin >> a[i];
cin >> m;
for (i = 0; i < m; i++) {
cin >> b;
for (j = 0; j < n; j++)
if (b == a[j]) {
result++;
break;
}
}
cout << result << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int n, a[100000], m, b, result = 0, i, j;
cin >> n;
for (i = 0; i < n; i++)
cin >> a[i];
cin >> m;
for (i = 0; i < m; i++) {
cin >> b;
for (j = 0; j < n; j++)
if (b == a[j]) {
result++;
break;
}
}
cout << result << endl;
return 0;
}
|
replace
| 4 | 5 | 4 | 5 |
0
| |
p02268
|
C++
|
Time Limit Exceeded
|
#include <algorithm>
#include <iostream>
using namespace std;
int search(int);
int n, S[100000];
int main() {
int q, T[50000], counter = 0;
cin >> n;
for (int i = 0; i < n; i++)
cin >> S[i];
cin >> q;
for (int i = 0; i < q; i++)
cin >> T[i];
sort(S, S + n);
for (int i = 0; i < q; i++)
counter += search(T[i]);
cout << counter << endl;
return 0;
}
int search(int t) {
int left = 0;
int right = n;
while (left <= right) {
int mid = (left + right) / 2;
if (S[mid] == t) {
return 1;
} else if (t < S[mid]) {
right = mid;
} else {
left = mid + 1;
}
}
return 0;
}
|
#include <algorithm>
#include <iostream>
using namespace std;
int search(int);
int n, S[100000];
int main() {
int q, T[50000], counter = 0;
cin >> n;
for (int i = 0; i < n; i++)
cin >> S[i];
cin >> q;
for (int i = 0; i < q; i++)
cin >> T[i];
sort(S, S + n);
for (int i = 0; i < q; i++)
counter += search(T[i]);
cout << counter << endl;
return 0;
}
int search(int t) {
int left = 0;
int right = n;
while (left < right) {
int mid = (left + right) / 2;
if (S[mid] == t) {
return 1;
} else if (t < S[mid]) {
right = mid;
} else {
left = mid + 1;
}
}
return 0;
}
|
replace
| 35 | 36 | 35 | 36 |
TLE
| |
p02268
|
C++
|
Runtime Error
|
#include <iostream>
using namespace std;
int a[10000], b[10000];
int binary(int l, int r, int c) {
while (l <= r) {
int p = (l + r) / 2, x, y;
if (a[p] == c)
return 1;
else if (c < a[p])
r = p - 1;
else
l = p + 1;
}
return 0;
}
int ar(int n) {
for (int i = 0; i < n; i++) {
cin >> b[i];
for (int j = 0; j < i; j++)
if (b[i] == b[j])
i--, n--;
}
return n;
}
int main() {
int p, q, n = 0;
cin >> p;
for (int i = 0; i < p; i++)
cin >> a[i];
cin >> q, q = ar(q);
for (int i = 0; i < q; i++)
n += binary(0, p - 1, b[i]);
cout << n << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int a[100000], b[100000];
int binary(int l, int r, int c) {
while (l <= r) {
int p = (l + r) / 2, x, y;
if (a[p] == c)
return 1;
else if (c < a[p])
r = p - 1;
else
l = p + 1;
}
return 0;
}
int ar(int n) {
for (int i = 0; i < n; i++) {
cin >> b[i];
for (int j = 0; j < i; j++)
if (b[i] == b[j])
i--, n--;
}
return n;
}
int main() {
int p, q, n = 0;
cin >> p;
for (int i = 0; i < p; i++)
cin >> a[i];
cin >> q, q = ar(q);
for (int i = 0; i < q; i++)
n += binary(0, p - 1, b[i]);
cout << n << endl;
return 0;
}
|
replace
| 3 | 4 | 3 | 4 |
0
| |
p02268
|
C++
|
Runtime Error
|
#include <iostream>
using namespace std;
int n, S[10010], q, key, cnt = 0;
int search() {
int left = 0, right = n, med;
while (left < right) {
med = (left + right) / 2;
if (S[med] == key)
return 1;
else if (S[med] < key)
left = med + 1;
else
right = med;
}
return 0;
}
int main() {
cin >> n;
for (int i = 0; i < n; i++)
cin >> S[i];
cin >> q;
for (int i = 0; i < q; i++) {
cin >> key;
cnt += search();
}
cout << cnt << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int n, S[100010], q, key, cnt = 0;
int search() {
int left = 0, right = n, med;
while (left < right) {
med = (left + right) / 2;
if (S[med] == key)
return 1;
else if (S[med] < key)
left = med + 1;
else
right = med;
}
return 0;
}
int main() {
cin >> n;
for (int i = 0; i < n; i++)
cin >> S[i];
cin >> q;
for (int i = 0; i < q; i++) {
cin >> key;
cnt += search();
}
cout << cnt << endl;
return 0;
}
|
replace
| 3 | 4 | 3 | 4 |
0
| |
p02268
|
C++
|
Runtime Error
|
#include <algorithm>
#include <iostream>
#include <map>
using namespace std;
int binSearch(int A[], int n, int key) {
int left = 0, right = n, mid;
while (left < right) {
mid = (left + right) / 2;
if (A[mid] == key)
return 1;
else if (A[mid] < key)
left = mid + 1; //+1???????????¨???????????§?????£??????
else
right = mid; // left<right
}
return 0;
}
int main() {
int n, sum = 0, q, S[10000], T[50000];
cin >> n;
for (int i = 0; i < n; i++)
cin >> S[i];
cin >> q;
for (int i = 0; i < q; i++) {
cin >> T[i];
if (binSearch(S, n, T[i]))
sum++;
}
cout << sum << endl;
}
|
#include <algorithm>
#include <iostream>
#include <map>
using namespace std;
int binSearch(int A[], int n, int key) {
int left = 0, right = n, mid;
while (left < right) {
mid = (left + right) / 2;
if (A[mid] == key)
return 1;
else if (A[mid] < key)
left = mid + 1; //+1???????????¨???????????§?????£??????
else
right = mid; // left<right
}
return 0;
}
int main() {
int n, sum = 0, q, S[100000], T[50000];
cin >> n;
for (int i = 0; i < n; i++)
cin >> S[i];
cin >> q;
for (int i = 0; i < q; i++) {
cin >> T[i];
if (binSearch(S, n, T[i]))
sum++;
}
cout << sum << endl;
}
|
replace
| 20 | 21 | 20 | 21 |
0
| |
p02268
|
C++
|
Runtime Error
|
#include <cstdio>
#include <iostream>
using namespace std;
int binSearch(int A[], int n, int key) {
int left = 0, right = n, mid;
while (left < right) {
mid = (left + right) / 2;
if (key == A[mid])
return 1;
if (key < A[mid])
right = mid;
if (key > A[mid])
left = mid + 1;
}
return 0;
}
int main(int argc, char const *argv[]) {
int i, n, q, A[10001], key, sum = 0;
cin >> n;
for (i = 0; i < n; i++)
scanf("%d", &A[i]);
cin >> q;
for (int i = 0; i < q; ++i) {
scanf("%d", &key);
sum += binSearch(A, n, key);
}
cout << sum << endl;
return 0;
}
|
#include <cstdio>
#include <iostream>
using namespace std;
int binSearch(int A[], int n, int key) {
int left = 0, right = n, mid;
while (left < right) {
mid = (left + right) / 2;
if (key == A[mid])
return 1;
if (key < A[mid])
right = mid;
if (key > A[mid])
left = mid + 1;
}
return 0;
}
int main(int argc, char const *argv[]) {
int i, n, q, A[100001], key, sum = 0;
cin >> n;
for (i = 0; i < n; i++)
scanf("%d", &A[i]);
cin >> q;
for (int i = 0; i < q; ++i) {
scanf("%d", &key);
sum += binSearch(A, n, key);
}
cout << sum << endl;
return 0;
}
|
replace
| 20 | 21 | 20 | 21 |
0
| |
p02268
|
C++
|
Time Limit Exceeded
|
#include <iostream>
#define REP(i, s, n) for (int i = s; i < n; i++)
#define rep(i, n) REP(i, 0, n)
using namespace std;
int main() {
int n, p, S[100000], T[100000];
bool exist;
cin >> n;
rep(i, n) cin >> S[i];
cin >> p;
rep(i, p) cin >> T[i];
int h;
rep(i, n) {
int ch = i;
REP(j, i, n) {
if (S[ch] > S[j])
ch = j;
}
h = S[ch];
S[ch] = S[i];
S[i] = h;
}
int count = 0;
rep(i, p) {
int lef = 0, rig = n;
exist = false;
while (lef < rig) {
int index = (lef + rig) / 2;
if (T[i] == S[index]) {
exist = true;
break;
} else if (T[i] < S[index]) {
rig = index;
} else {
lef = index + 1;
}
}
if (exist) {
count++;
}
}
cout << count << endl;
}
|
#include <iostream>
#define REP(i, s, n) for (int i = s; i < n; i++)
#define rep(i, n) REP(i, 0, n)
using namespace std;
int main() {
int n, p, S[100000], T[100000];
bool exist;
cin >> n;
rep(i, n) cin >> S[i];
cin >> p;
rep(i, p) cin >> T[i];
int count = 0;
rep(i, p) {
int lef = 0, rig = n;
exist = false;
while (lef < rig) {
int index = (lef + rig) / 2;
if (T[i] == S[index]) {
exist = true;
break;
} else if (T[i] < S[index]) {
rig = index;
} else {
lef = index + 1;
}
}
if (exist) {
count++;
}
}
cout << count << endl;
}
|
delete
| 12 | 24 | 12 | 12 |
TLE
| |
p02268
|
C++
|
Time Limit Exceeded
|
#include <iostream>
using namespace std;
int BSearch(int x, int A[], int N) {
int left = 0;
int right = N;
while (left <= right) {
int mid = (left + right) / 2;
if (A[mid] == x) {
return mid;
} else if (x < A[mid]) {
right = mid;
} else {
left = mid + 1;
}
}
return -1;
}
int main() {
int n;
cin >> n;
int S[n];
for (int i = 0; i < n; i++) {
cin >> S[i];
}
int q;
cin >> q;
int T[q];
for (int i = 0; i < q; i++) {
cin >> T[i];
}
int ans = 0;
for (int i = 0; i < q; i++) {
if (BSearch(T[i], S, n) != -1) {
ans++;
}
}
cout << ans << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int BSearch(int x, int A[], int N) {
int left = 0;
int right = N;
while (left < right) {
int mid = (left + right) / 2;
if (A[mid] == x) {
return mid;
} else if (x < A[mid]) {
right = mid;
} else {
left = mid + 1;
}
}
return -1;
}
int main() {
int n;
cin >> n;
int S[n];
for (int i = 0; i < n; i++) {
cin >> S[i];
}
int q;
cin >> q;
int T[q];
for (int i = 0; i < q; i++) {
cin >> T[i];
}
int ans = 0;
for (int i = 0; i < q; i++) {
if (BSearch(T[i], S, n) != -1) {
ans++;
}
}
cout << ans << endl;
return 0;
}
|
replace
| 7 | 8 | 7 | 8 |
TLE
| |
p02268
|
C++
|
Time Limit Exceeded
|
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
bool binarySearch(vector<int> vi, int t) {
int right = vi.size() - 1;
int left = 0;
bool flg = true;
while (flg) {
if (right == left)
flg = false;
int center = (left + right) / 2;
if (vi[center] < t) {
left = center;
} else if (vi[center] > t) {
right = center;
} else {
return true;
}
}
return false;
}
int main() {
vector<int> vi;
int n, q;
int count = 0;
cin >> n;
for (int i = 0; i < n; i++) {
int s;
cin >> s;
vi.push_back(s);
}
sort(vi.begin(), vi.end());
cin >> q;
for (int i = 0; i < q; i++) {
int t;
cin >> t;
count += binarySearch(vi, t);
}
cout << count << endl;
return 0;
};
|
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
bool binarySearch(vector<int> vi, int t) {
int right = vi.size() - 1;
int left = 0;
bool flg = true;
while (flg) {
if (right == left)
flg = false;
int center = (left + right) / 2;
if (vi[center] < t) {
left = center + 1;
} else if (vi[center] > t) {
right = center;
} else {
return true;
}
}
return false;
}
int main() {
vector<int> vi;
int n, q;
int count = 0;
cin >> n;
for (int i = 0; i < n; i++) {
int s;
cin >> s;
vi.push_back(s);
}
sort(vi.begin(), vi.end());
cin >> q;
for (int i = 0; i < q; i++) {
int t;
cin >> t;
count += binarySearch(vi, t);
}
cout << count << endl;
return 0;
};
|
replace
| 15 | 16 | 15 | 16 |
TLE
| |
p02268
|
C++
|
Time Limit Exceeded
|
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <list>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int s[100000], n;
int binsearch(int key) {
int left = 0, right = n, mid = (left + right) / 2;
while (left < right) {
if (s[mid] == key)
return 1;
else if (s[mid] > key) {
right = mid;
mid = (left + right) / 2;
} else if (s[mid] < key) {
left = mid;
mid = (left + right) / 2;
}
}
return 0;
}
int main() {
int m, count = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> s[i];
}
cin >> m;
for (int i = 0; i < m; i++) {
int t;
cin >> t;
count += binsearch(t);
}
cout << count << endl;
return 0;
}
|
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <list>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int s[100000], n;
int binsearch(int key) {
int left = 0, right = n, mid = (left + right) / 2;
while (left < right) {
if (s[mid] == key)
return 1;
else if (s[mid] > key) {
right = mid;
mid = (left + right) / 2;
} else if (s[mid] < key) {
left = mid + 1;
mid = (left + right) / 2;
}
}
return 0;
}
int main() {
int m, count = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> s[i];
}
cin >> m;
for (int i = 0; i < m; i++) {
int t;
cin >> t;
count += binsearch(t);
}
cout << count << endl;
return 0;
}
|
replace
| 22 | 23 | 22 | 23 |
TLE
| |
p02268
|
C++
|
Time Limit Exceeded
|
#include <iostream>
using namespace std;
int main() {
int n, q;
cin >> n;
int *S = new int[n];
int number;
for (int i; i < n; ++i) {
cin >> number;
S[i] = number;
}
cin >> q;
int *T = new int[q];
for (int i = 0; i < q; ++i) {
cin >> number;
T[i] = number;
}
int cnt = 0;
for (int i = 0; i < q; ++i) {
int left = 0, right = n;
while (left < right) {
int mid = (left + right) / 2;
if (S[mid] == T[i]) {
cnt++;
break;
} else if (S[mid] > T[i]) {
right = mid;
} else if (S[mid] < T[i]) {
left = mid;
}
}
}
cout << cnt << "\n";
delete[] T;
delete[] S;
}
|
#include <iostream>
using namespace std;
int main() {
int n, q;
cin >> n;
int *S = new int[n];
int number;
for (int i; i < n; ++i) {
cin >> number;
S[i] = number;
}
cin >> q;
int *T = new int[q];
for (int i = 0; i < q; ++i) {
cin >> number;
T[i] = number;
}
int cnt = 0;
for (int i = 0; i < q; ++i) {
int left = 0, right = n;
while (left < right) {
int mid = (left + right) / 2;
if (S[mid] == T[i]) {
cnt++;
break;
} else if (S[mid] > T[i]) {
right = mid;
} else if (S[mid] < T[i]) {
left = mid + 1;
}
}
}
cout << cnt << "\n";
delete[] T;
delete[] S;
}
|
replace
| 30 | 31 | 30 | 31 |
TLE
| |
p02268
|
C++
|
Time Limit Exceeded
|
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define fori(i, k, n) for (int i = k; i < (int)n; i++)
using namespace std;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0};
const int dX[8] = {0, 1, 1, 1, 0, -1, -1, -1},
dY[8] = {1, 1, 0, -1, -1, -1, 0, 1};
struct XY {
int x;
int y;
};
/*
(char)'1' - (int)48 = (int)1;
*/
int main() {
int n, q;
vector<int> s;
cin >> n;
int j;
rep(i, n) {
cin >> j;
s.push_back(j);
}
cin >> q;
int ans = 0;
rep(i, q) {
cin >> j;
int l = 0, r = n;
while (l != r) {
bool ri = true;
if (s[(l + r) / 2] > j) {
r = (l + r) / 2 - 1;
} else if (s[(l + r) / 2] < j) {
l = (l + r) / 2 + 1;
} else
break;
}
if (s[(l + r) / 2] == j)
ans++;
}
cout << ans << endl;
}
|
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define fori(i, k, n) for (int i = k; i < (int)n; i++)
using namespace std;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0};
const int dX[8] = {0, 1, 1, 1, 0, -1, -1, -1},
dY[8] = {1, 1, 0, -1, -1, -1, 0, 1};
struct XY {
int x;
int y;
};
/*
(char)'1' - (int)48 = (int)1;
*/
int main() {
int n, q;
vector<int> s;
cin >> n;
int j;
rep(i, n) {
cin >> j;
s.push_back(j);
}
cin >> q;
int ans = 0;
rep(i, q) {
cin >> j;
int l = 0, r = n;
if (binary_search(s.begin(), s.end(), j))
ans++;
}
cout << ans << endl;
}
|
replace
| 43 | 53 | 43 | 44 |
TLE
| |
p02268
|
C++
|
Runtime Error
|
//
// main.cpp
// ALDS1_4_B
//
// Created by ptyuan on 2018/10/23.
// Copyright © 2018 YY. All rights reserved.
//
#include <cstdio>
#include <iostream>
static const int kNotFound = -1;
int binarySearch(int *array, int n, int key) {
int low = 0;
int hight = n - 1;
while (low <= hight) {
int middle = (low + hight) * 0.5;
int middleValue = array[middle];
if (middleValue == key) {
return middle;
} else if (key > middleValue) {
low = middle + 1;
} else {
hight = middle - 1;
}
}
return kNotFound;
}
int main(int argc, const char *argv[]) {
int n = 0;
int s[10001] = {0};
scanf("%d", &n);
for (int i = 0; i < n; ++i) {
scanf("%d", s + i);
}
int q = 0;
int sum = 0;
scanf("%d", &q);
for (int i = 0; i < q; i++) {
int temp = 0;
scanf("%d", &temp);
if (kNotFound != binarySearch(s, n, temp)) {
sum++;
}
}
printf("%d\n", sum);
return 0;
}
|
//
// main.cpp
// ALDS1_4_B
//
// Created by ptyuan on 2018/10/23.
// Copyright © 2018 YY. All rights reserved.
//
#include <cstdio>
#include <iostream>
static const int kNotFound = -1;
int binarySearch(int *array, int n, int key) {
int low = 0;
int hight = n - 1;
while (low <= hight) {
int middle = (low + hight) * 0.5;
int middleValue = array[middle];
if (middleValue == key) {
return middle;
} else if (key > middleValue) {
low = middle + 1;
} else {
hight = middle - 1;
}
}
return kNotFound;
}
int main(int argc, const char *argv[]) {
int n = 0;
int s[100010] = {0};
scanf("%d", &n);
for (int i = 0; i < n; ++i) {
scanf("%d", s + i);
}
int q = 0;
int sum = 0;
scanf("%d", &q);
for (int i = 0; i < q; i++) {
int temp = 0;
scanf("%d", &temp);
if (kNotFound != binarySearch(s, n, temp)) {
sum++;
}
}
printf("%d\n", sum);
return 0;
}
|
replace
| 33 | 34 | 33 | 34 |
0
| |
p02268
|
C++
|
Time Limit Exceeded
|
#include <cstdio>
#include <cstdlib>
#include <iostream>
int main() {
int n, q;
std::cin >> n;
int *S = new int[n];
for (int i = 0; i < n; i++) {
scanf("%d", &S[i]);
}
std::cin >> q;
int *T = new int[q];
for (int i = 0; i < q; i++) {
scanf("%d", &T[i]);
}
int cnt = 0;
for (int i = 0; i < q; i++) {
int head = 0;
int tail = n - 1;
int j = (head + tail) / 2;
while (1) {
if (S[j] == T[i]) {
cnt++;
break;
} else if (head - tail == 1) {
break;
} else if (S[j] > T[i]) {
tail = j;
j = (head + tail) / 2;
} else if (S[j] < T[i]) {
head = j;
j = (head + tail) / 2;
}
}
}
printf("%d\n", cnt);
return 0;
}
|
#include <cstdio>
#include <cstdlib>
#include <iostream>
int main() {
int n, q;
std::cin >> n;
int *S = new int[n];
for (int i = 0; i < n; i++) {
scanf("%d", &S[i]);
}
std::cin >> q;
int *T = new int[q];
for (int i = 0; i < q; i++) {
scanf("%d", &T[i]);
}
int cnt = 0;
for (int i = 0; i < q; i++) {
int head = 0;
int tail = n - 1;
int j = (head + tail) / 2;
while (1) {
if (S[j] == T[i]) {
cnt++;
break;
} else if (tail - head == 1) {
if (S[head] == T[i] || S[tail] == T[i]) {
cnt++;
}
break;
} else if (S[j] > T[i]) {
tail = j;
j = (head + tail) / 2;
} else if (S[j] < T[i]) {
head = j;
j = (head + tail) / 2;
}
}
}
printf("%d\n", cnt);
return 0;
}
|
replace
| 26 | 27 | 26 | 30 |
TLE
| |
p02268
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int s[10000];
int main() {
int n;
scanf("%d", &n);
rep(i, n) scanf("%d", &s[i]);
int q;
scanf("%d", &q);
int cnt = 0;
rep(i, q) {
int t;
scanf("%d", &t);
if (binary_search(s, s + n, t))
cnt++;
}
printf("%d\n", cnt);
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int s[100000];
int main() {
int n;
scanf("%d", &n);
rep(i, n) scanf("%d", &s[i]);
int q;
scanf("%d", &q);
int cnt = 0;
rep(i, q) {
int t;
scanf("%d", &t);
if (binary_search(s, s + n, t))
cnt++;
}
printf("%d\n", cnt);
}
|
replace
| 4 | 5 | 4 | 5 |
0
| |
p02268
|
C++
|
Time Limit Exceeded
|
#include <cstdio>
using namespace std;
int S[1000000], n;
int serch(int key) {
int left = 0, right, mid;
right = n;
while (left < right) {
mid = (left + right) / 2;
if (key == S[mid])
return 1;
if (key > S[mid])
left = mid;
else if (key < S[mid])
right = mid;
}
return 0;
}
int main() {
int q, key;
int i, sum = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &S[i]);
}
scanf("%d", &q);
for (i = 0; i < q; i++) {
scanf("%d", &key);
if (serch(key))
sum++;
}
printf("%d\n", sum);
return 0;
}
|
#include <cstdio>
using namespace std;
int S[1000000], n;
int serch(int key) {
int left = 0, right, mid;
right = n;
while (left < right) {
mid = (left + right) / 2;
if (key == S[mid])
return 1;
if (key > S[mid])
left = mid + 1;
else if (key < S[mid])
right = mid;
}
return 0;
}
int main() {
int q, key;
int i, sum = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &S[i]);
}
scanf("%d", &q);
for (i = 0; i < q; i++) {
scanf("%d", &key);
if (serch(key))
sum++;
}
printf("%d\n", sum);
return 0;
}
|
replace
| 11 | 12 | 11 | 12 |
TLE
| |
p02268
|
C++
|
Time Limit Exceeded
|
#include <cstdio>
#include <vector>
using namespace std;
bool binary_search(int target, int low, int high, vector<int> &S) {
int mid = low + (high - low) / 2;
if (S.at(mid) == target) {
return true;
}
if (low == high)
return false;
if (S.at(mid) > target) {
return binary_search(target, low, mid - 1, S);
} else {
return binary_search(target, mid + 1, high, S);
}
}
int main() {
int n, q, a, c = 0, i, j;
vector<int> S;
scanf("%d", &n);
S.resize(n);
for (i = 0; i < n; ++i) {
scanf("%d", &S[i]);
}
scanf("%d", &q);
for (j = 0; j < q; ++j) {
scanf("%d", &a);
if (binary_search(a, 0, n - 1, S))
++c;
}
printf("%d\n", c);
return 0;
}
|
#include <cstdio>
#include <vector>
using namespace std;
bool binary_search(int target, int low, int high, vector<int> &S) {
int mid = low + (high - low) / 2;
if (S.at(mid) == target) {
return true;
}
if (low >= high)
return false;
if (S.at(mid) > target) {
return binary_search(target, low, mid - 1, S);
} else {
return binary_search(target, mid + 1, high, S);
}
}
int main() {
int n, q, a, c = 0, i, j;
vector<int> S;
scanf("%d", &n);
S.resize(n);
for (i = 0; i < n; ++i) {
scanf("%d", &S[i]);
}
scanf("%d", &q);
for (j = 0; j < q; ++j) {
scanf("%d", &a);
if (binary_search(a, 0, n - 1, S))
++c;
}
printf("%d\n", c);
return 0;
}
|
replace
| 9 | 10 | 9 | 10 |
TLE
| |
p02268
|
C++
|
Time Limit Exceeded
|
#include <iostream>
using namespace std;
int main() {
int n, q, s[100001], t, ans = 0;
cin >> n;
for (int i = 0; i < n; i++)
cin >> s[i];
cin >> q;
for (int i = 0; i < q; i++) {
cin >> t;
int l = 0, r = n, m;
while (l < r) {
m = (l + r) / 2;
if (t < s[m])
r = m;
else if (t > s[m])
l = m;
else {
ans++;
break;
}
}
}
cout << ans << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int n, q, s[100001], t, ans = 0;
cin >> n;
for (int i = 0; i < n; i++)
cin >> s[i];
cin >> q;
for (int i = 0; i < q; i++) {
cin >> t;
int l = 0, r = n, m;
while (l < r) {
m = (l + r) / 2;
if (t < s[m])
r = m;
else if (t > s[m])
l = m + 1;
else {
ans++;
break;
}
}
}
cout << ans << endl;
return 0;
}
|
replace
| 16 | 17 | 16 | 17 |
TLE
| |
p02268
|
C++
|
Time Limit Exceeded
|
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int S[n];
for (int i = 0; i < n; i++) {
cin >> S[i];
}
int q;
cin >> q;
int T[q];
for (int i = 0; i < q; i++) {
cin >> T[i];
}
int cnt = 0;
for (int ti = 0; ti < q; ti++) {
int left = 0, right = n, mid;
while (left < right) {
mid = (left + right) / 2;
if (S[mid] == T[ti]) {
cnt++;
break;
} else if (T[ti] < S[mid])
right = mid;
else
left = mid - 1;
}
}
cout << cnt << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int S[n];
for (int i = 0; i < n; i++) {
cin >> S[i];
}
int q;
cin >> q;
int T[q];
for (int i = 0; i < q; i++) {
cin >> T[i];
}
int cnt = 0;
for (int ti = 0; ti < q; ti++) {
int left = 0, right = n, mid;
while (left < right) {
mid = (left + right) / 2;
if (S[mid] == T[ti]) {
cnt++;
break;
} else if (T[ti] < S[mid])
right = mid;
else
left = mid + 1;
}
}
cout << cnt << endl;
return 0;
}
|
replace
| 29 | 30 | 29 | 30 |
TLE
| |
p02268
|
C++
|
Time Limit Exceeded
|
#include <iostream>
#include <stdio.h>
using namespace std;
int search(int A[], int n, int key) {
int i = 0;
A[n] = key;
while (A[i] != key)
i++;
return i != n;
}
int main() {
int n;
scanf("%d", &n);
int S[n];
for (int i = 0; i < n; i++) {
scanf("%d", &S[i]);
}
int q;
scanf("%d", &q);
int T[q];
for (int i = 0; i < q; i++) {
scanf("%d", &T[i]);
}
int cnt = 0;
for (int i = 0; i < q; i++) {
cnt += search(S, n, T[i]);
}
printf("%d\n", cnt);
return 0;
}
|
#include <iostream>
#include <stdio.h>
using namespace std;
int search(int A[], int n, int key) {
int left = 0;
int right = n;
while (left < right) {
int mid = (left + right) / 2;
if (A[mid] == key) {
return 1;
} else if (key < A[mid]) {
right = mid;
} else {
left = mid + 1;
}
}
return 0;
}
int main() {
int n;
scanf("%d", &n);
int S[n];
for (int i = 0; i < n; i++) {
scanf("%d", &S[i]);
}
int q;
scanf("%d", &q);
int T[q];
for (int i = 0; i < q; i++) {
scanf("%d", &T[i]);
}
int cnt = 0;
for (int i = 0; i < q; i++) {
cnt += search(S, n, T[i]);
}
printf("%d\n", cnt);
return 0;
}
|
replace
| 5 | 10 | 5 | 18 |
TLE
| |
p02268
|
C++
|
Time Limit Exceeded
|
#include <iostream>
#include <vector>
using namespace std;
bool binarySearch(vector<int> vec, int target) {
int l = 0;
int r = vec.size();
while (l < r) {
int mid = (l + r) / 2;
if (vec[mid] == target) {
return (true);
} else if (vec[mid] < target) {
l = mid + 1;
} else {
r = mid;
}
}
return (false);
}
void solve() {
int n;
cin >> n;
vector<int> S(n);
for (int i = 0; i < n; ++i) {
cin >> S[i];
}
int q;
cin >> q;
vector<int> T(q);
for (int i = 0; i < q; ++i) {
cin >> T[i];
}
int ans = 0;
for (int i = 0; i < q; ++i) {
for (int j = 0; j < n; ++j) {
if (binarySearch(S, T[i])) {
++ans;
break;
}
}
}
cout << ans << endl;
}
int main() {
solve();
return (0);
}
|
#include <iostream>
#include <vector>
using namespace std;
bool binarySearch(vector<int> vec, int target) {
int l = 0;
int r = vec.size();
while (l < r) {
int mid = (l + r) / 2;
if (vec[mid] == target) {
return (true);
} else if (vec[mid] < target) {
l = mid + 1;
} else {
r = mid;
}
}
return (false);
}
void solve() {
int n;
cin >> n;
vector<int> S(n);
for (int i = 0; i < n; ++i) {
cin >> S[i];
}
int q;
cin >> q;
vector<int> T(q);
for (int i = 0; i < q; ++i) {
cin >> T[i];
}
int ans = 0;
for (int i = 0; i < q; ++i) {
if (binarySearch(S, T[i])) {
++ans;
}
}
cout << ans << endl;
}
int main() {
solve();
return (0);
}
|
replace
| 36 | 41 | 36 | 38 |
TLE
| |
p02268
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
#define vi vector<int>
#define vvi vector<vector<int>>
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define vb vector<bool>
#define vc vector<char>
#define vs vector<string>
using ll = long long;
using ld = long double;
#define int ll
#define INF 1e9
#define EPS 0.0000000001
#define rep(i, n) for (int i = 0; i < n; i++)
#define loop(i, s, n) for (int i = s; i < n; i++)
#define all(in) in.begin(), in.end()
template <class T, class S> void cmin(T &a, const S &b) {
if (a > b)
a = b;
}
template <class T, class S> void cmax(T &a, const S &b) {
if (a < b)
a = b;
}
#define MAX 9999999
using namespace std;
typedef pair<int, int> pii;
typedef pair<int, pii> piii;
#define mp make_pair
signed main() {
int n;
cin >> n;
vi v(n);
rep(i, n) cin >> v[i];
int m;
cin >> m;
int ans = 0;
rep(i, m) {
int t;
cin >> t;
int imax = n;
int imin = 0;
int mid;
while (imax > imin) {
mid = (imax + imin) / 2;
if (v[mid] > t)
imax = mid;
else if (v[mid] < t)
imin += 1;
else {
ans++;
break;
}
}
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
#define vi vector<int>
#define vvi vector<vector<int>>
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define vb vector<bool>
#define vc vector<char>
#define vs vector<string>
using ll = long long;
using ld = long double;
#define int ll
#define INF 1e9
#define EPS 0.0000000001
#define rep(i, n) for (int i = 0; i < n; i++)
#define loop(i, s, n) for (int i = s; i < n; i++)
#define all(in) in.begin(), in.end()
template <class T, class S> void cmin(T &a, const S &b) {
if (a > b)
a = b;
}
template <class T, class S> void cmax(T &a, const S &b) {
if (a < b)
a = b;
}
#define MAX 9999999
using namespace std;
typedef pair<int, int> pii;
typedef pair<int, pii> piii;
#define mp make_pair
signed main() {
int n;
cin >> n;
vi v(n);
rep(i, n) cin >> v[i];
int m;
cin >> m;
int ans = 0;
rep(i, m) {
int t;
cin >> t;
int imax = n;
int imin = 0;
int mid;
while (imax > imin) {
mid = (imax + imin) / 2;
if (v[mid] > t)
imax = mid;
else if (v[mid] < t)
imin = mid + 1;
else {
ans++;
break;
}
}
}
cout << ans << endl;
}
|
replace
| 48 | 49 | 48 | 49 |
TLE
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.