QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#88426 | #5668. Cell Nuclei Detection | CCSU_LRF | Compile Error | / | / | C++14 | 3.1kb | 2023-03-16 11:04:05 | 2023-03-16 11:04:08 |
Judging History
你现在查看的是最新测评结果
- [2023-08-10 23:21:45]
- System Update: QOJ starts to keep a history of the judgings of all the submissions.
- [2023-03-16 11:04:08]
- 评测
- 测评结果:Compile Error
- 用时:0ms
- 内存:0kb
- [2023-03-16 11:04:05]
- 提交
answer
using namespace std;
const int N = 2010, M = 50010, inf = 1e5, SIZ = 2000;
int n, m;
struct Box{
int x1, y1, x2, y2, area;
void input(){ cin >> x1 >> y1 >> x2 >> y2; }
int get_id(){ return x1 * SIZ + y1; } //返回左下角坐标对应编号
void get_area(){
area = (x2 - x1) * (y2 - y1);
}
}tr[M], de[M];
struct edge{
int to, nex, w;
}e[M * 200];
int tot, s, t, head[M * 2];
void add(int from, int to, int w){
e[++ tot].w = w;
e[tot].to = to;
e[tot].nex = head[from];
head[from] = tot;
}
int dep[M * 2];
bool bfs(){
queue<int>q;
q.push(s);
for(int i = s; i <= t; i ++) dep[i] = 0;
dep[s] = 1;
while(!q.empty()){
int u = q.front(); q.pop();
for(int i = head[u]; i; i = e[i].nex){
int v = e[i].to;
if(e[i].w && !dep[v]){
dep[v] = dep[u] + 1;
if(v == t) return true;
q.push(v);
}
}
}
return dep[t];
}
int dfs(int u, int inflow){
if(u == t) return inflow;
int outflow = 0;
for(int i = head[u]; i && inflow; i = e[i].nex){
int v = e[i].to;
if(e[i].w && dep[v] == dep[u] + 1){
int flow = dfs(v, min(e[i].w, inflow));
e[i].w -= flow;
e[i ^ 1].w += flow;
inflow -= flow;
outflow += flow;
}
}
if(outflow == 0) dep[u] = 0;
return outflow;
}
vector<int>g[N * N];//存坐标所有的矩形左上角编号
void init(){
tot = 1;
for(int i = 1; i <= m; i ++){
g[tr[i].get_id()].clear();
}
for(int i = s; i <= t; i ++) head[i] = 0;
}
int overlap_area(Box &a, Box &b){//计算线段交
int x = max(0, min(a.x2, b.x2) - max(a.x1, b.x1));
int y = max(0, min(a.y2, b.y2) - max(a.y1, b.y1));
return x * y;
}
void build_edge(int u){
Box &A = de[u];
for(int i = max(A.x1 - 2, 0); i <= A.x2 + 2; i ++){
for(int j = max(A.y1 - 2, 0); j <= A.y2 + 2; j ++){
int idx = i * SIZ + j;
for(int id : g[idx]){
if(overlap_area(A, tr[id]) * 2 >= tr[id].area){
add(u, id + n, 1);
add(id + n, u, 0);
}
}
}
}
}
void solve(){
init();
cin >> m >> n;
for(int i = 1; i <= m; i ++){//真实框
tr[i].input();
tr[i].get_area();
g[tr[i].get_id()].push_back(i);
}
for(int i = 1; i <= n; i ++){// 搜索框
de[i].input();
de[i].get_area();
}
s = 0, t = n + m + 1;
for(int i = 1; i <= n; i ++){
add(s, i, 1);
add(i, s, 0);
build_edge(i);
}
for(int i = 1; i <= m; i ++){
add(i + n, t, 1);
add(t, i + n, 0);
}
int ans = 0;
while(bfs()){
ans += dfs(s, inf);
}
cout << ans << "\n";
}
int main(){
ios::sync_with_stdio(false);
cout.tie(NULL);
int t;
cin >> t;
while(t --){
solve();
}
return 0;
}
Details
answer.code: In member function ‘void Box::input()’: answer.code:8:19: error: ‘cin’ was not declared in this scope 8 | void input(){ cin >> x1 >> y1 >> x2 >> y2; } | ^~~ answer.code:1:1: note: ‘std::cin’ is defined in header ‘<iostream>’; did you forget to ‘#include <iostream>’? +++ |+#include <iostream> 1 | answer.code: In function ‘bool bfs()’: answer.code:28:5: error: ‘queue’ was not declared in this scope 28 | queue<int>q; | ^~~~~ answer.code:1:1: note: ‘std::queue’ is defined in header ‘<queue>’; did you forget to ‘#include <queue>’? +++ |+#include <queue> 1 | answer.code:28:11: error: expected primary-expression before ‘int’ 28 | queue<int>q; | ^~~ answer.code:29:5: error: ‘q’ was not declared in this scope 29 | q.push(s); | ^ answer.code: In function ‘int dfs(int, int)’: answer.code:52:31: error: ‘min’ was not declared in this scope 52 | int flow = dfs(v, min(e[i].w, inflow)); | ^~~ answer.code: At global scope: answer.code:63:1: error: ‘vector’ does not name a type 63 | vector<int>g[N * N];//存坐标所有的矩形左上角编号 | ^~~~~~ answer.code: In function ‘void init()’: answer.code:67:9: error: ‘g’ was not declared in this scope 67 | g[tr[i].get_id()].clear(); | ^ answer.code: In function ‘int overlap_area(Box&, Box&)’: answer.code:74:20: error: ‘min’ was not declared in this scope 74 | int x = max(0, min(a.x2, b.x2) - max(a.x1, b.x1)); | ^~~ answer.code:74:38: error: ‘max’ was not declared in this scope 74 | int x = max(0, min(a.x2, b.x2) - max(a.x1, b.x1)); | ^~~ answer.code:74:13: error: ‘max’ was not declared in this scope 74 | int x = max(0, min(a.x2, b.x2) - max(a.x1, b.x1)); | ^~~ answer.code: In function ‘void build_edge(int)’: answer.code:81:17: error: ‘max’ was not declared in this scope 81 | for(int i = max(A.x1 - 2, 0); i <= A.x2 + 2; i ++){ | ^~~ answer.code:84:26: error: ‘g’ was not declared in this scope 84 | for(int id : g[idx]){ | ^ answer.code: In function ‘void solve()’: answer.code:96:5: error: ‘cin’ was not declared in this scope 96 | cin >> m >> n; | ^~~ answer.code:96:5: note: ‘std::cin’ is defined in header ‘<iostream>’; did you forget to ‘#include <iostream>’? answer.code:100:9: error: ‘g’ was not declared in this scope 100 | g[tr[i].get_id()].push_back(i); | ^ answer.code:122:5: error: ‘cout’ was not declared in this scope 122 | cout << ans << "\n"; | ^~~~ answer.code:122:5: note: ‘std::cout’ is defined in header ‘<iostream>’; did you forget to ‘#include <iostream>’? answer.code: In function ‘int main()’: answer.code:125:5: error: ‘ios’ has not been declared 125 | ios::sync_with_stdio(false); | ^~~ answer.code:126:5: error: ‘cout’ was not declared in this scope 126 | cout.tie(NULL); | ^~~~ answer.code:126:5: note: ‘std::cout’ is defined in header ‘<iostream>’; did you forget to ‘#include <iostream>’? answer.code:126:14: error: ‘NULL’ was not declared in this scope 126 | cout.tie(NULL); | ^~~~ answer.code:1:1: note: ‘NULL’ is defined in header ‘<cstddef>’; did you forget to ‘#include <cstddef>’? +++ |+#include <cstddef> 1 | answer.code:128:5: error: ‘cin’ was not declared in this scope 128 | cin >> t; | ^~~ answer.code:128:5: note: ‘std::cin’ is defined in header ‘<iostream>’; did you forget to ‘#include <iostream>’?