poj2653

题意：按顺序给出一些木棍，输出在最上面的木棍标号

方法：用一个链表保存最上面的木棍，每读取一根木棍就将之与链表中的木棍求交，若相交则将链表中相交的剔除，最后将新的木棍加入链表。（此题不必考虑不规范相交的情况，测试数据貌似没有)

WA点：开始自己写的简单的链表，老是RE，（看来基本功很差，原因在于p指向一个node，我先把p删除了才p=p->next。大概用了700-800毫秒。改用C++的标准库vector竟然只用了600+而且省代码，但是用list就1200+了

 

值得一提的是algorithm库中的remove_if函数不错，但是该函数并不是真正的remove，还要用erase函数。故称做erase-remove idiom

 

未用stl的代码

#include <iostream> #include <cstring> #include <algorithm> #include <cstdio> using namespace std; int res[1010]; int rescnt; struct Point { double x,y; }; struct Segment { Point p1,p2; int index; }; const double eps = 1E-6; int sig(double d ) { return (d > eps) - (d < -eps); } double dot(const Point& o,const Point & a,const Point& b) { return (a.x - o.x)* (b.x- o.x) + (a.y - o.y)*(b.y - o.y); } int btw(const Point& x,const Point& a,const Point & b) { return sig(dot(x,a,b)); } double cross(const Point& o,const Point& a,const Point&b) { return (a.x - o.x)* (b.y - o.y) -( b.x - o.x) * (a.y - o.y); } int SegCross(const Point& a, const Point& b,const Point& c,const Point& d) { int d1,d2,d3,d4; d1 = sig( cross(a,b,c)); d2 = sig( cross(a,b,d)); d3 = sig( cross(c,d,a)); d4 = sig( cross(c,d,b)); if((d1^d2)==-2&& (d3^d4)==-2) return 1; if( d1== 0 && btw(c,a,b)<=0 || d2 == 0 && btw(d,a,b)<=0|| d3 == 0 && btw(a,c,d)<=0 || d4 == 0 && btw(b,c,d)<=0) return 2; return 0; } struct Node { Segment seg; Node * next; }; struct Chain { Node * first; int len; Chain() { first = NULL; len = 0; } void Delete(const Segment& seg) { //此函数删除与seg相交的top中的所有线段 Node * p ; // cout << first->seg.index << " " << seg.index << "seg cross = " << SegCross(first->seg.p1,first->seg.p2,seg.p1,seg.p2) << endl; while(first && SegCross(first->seg.p1,first->seg.p2,seg.p1,seg.p2)==1) { p = first; first = first->next; //cout << "delete p" << p->seg.index << endl; delete p; len--; } Node * temp,* last = first; if(last) p = last->next; else p = NULL; while(p) { // cout << p->next->seg.index << " ^^ " << seg.index << "seg cross = " << SegCross(p->next->seg.p1,p->next->seg.p2,seg.p1,seg.p2) << endl; if(p && SegCross(p->seg.p1,p->seg.p2,seg.p1,seg.p2)==1) { temp = p; last->next = p->next; p = p->next; //cout << "delete temp" << temp->seg.index << endl; //cout << "temp-> next = " << temp->next << endl; //cout << " p = " << p << endl; delete temp; len--; } else { last = p; //system("pause"); p = p->next; } } AddFirst(seg); } void AddFirst(const Segment& seg) { Node* temp = new Node; len++; temp->seg = seg; temp->next = first; first = temp; //cout << "add seg" << seg.index << endl; } void Output() { Node * p = first; Node * temp; rescnt = 0; while(p) { res[rescnt++] = p->seg.index; temp = p; p = p->next; delete temp; } for(int i = rescnt-1; i >=0; i--) { cout << res[i] ; if(i == 0) cout << "." << endl; else cout << ", "; } len = 0; first = NULL; } }; int main() { int n; Segment tseg; Chain top; while(cin >> n && n) { for(int w = 1; w <= n; w++) { scanf("%lf%lf%lf%lf",&tseg.p1.x,&tseg.p1.y,&tseg.p2.x,&tseg.p2.y); tseg.index = w; if(top.len == 0) top.AddFirst(tseg); else { top.Delete(tseg); } } cout << "Top sticks: "; top.Output(); } return 0; }

 

使用vector的代码

#include <iostream> #include <cstring> #include <algorithm> #include <cstdio> #include <vector> using namespace std; struct Point { double x,y; }; struct Segment { Point p1,p2; int index; }; const double eps = 1E-6; int sig(double d ) { return (d > eps) - (d < -eps); } double dot(const Point& o,const Point & a,const Point& b) { return (a.x - o.x)* (b.x- o.x) + (a.y - o.y)*(b.y - o.y); } int btw(const Point& x,const Point& a,const Point & b) { return sig(dot(x,a,b)); } double cross(const Point& o,const Point& a,const Point&b) { return (a.x - o.x)* (b.y - o.y) -( b.x - o.x) * (a.y - o.y); } int SegCross(const Point& a, const Point& b,const Point& c,const Point& d) { int d1,d2,d3,d4; d1 = sig( cross(a,b,c)); d2 = sig( cross(a,b,d)); d3 = sig( cross(c,d,a)); d4 = sig( cross(c,d,b)); if((d1^d2)==-2&& (d3^d4)==-2) return 1; if( d1== 0 && btw(c,a,b)<=0 || d2 == 0 && btw(d,a,b)<=0|| d3 == 0 && btw(a,c,d)<=0 || d4 == 0 && btw(b,c,d)<=0) return 2; return 0; } Segment tseg; bool Is_OK(Segment seg) { return SegCross(seg.p1,seg.p2,tseg.p1,tseg.p2)==1; } int main() { int n; vector<Segment> v; while(cin >> n && n) { v.erase(v.begin(),v.end()); for(int w = 1; w <= n; w++) { scanf("%lf%lf%lf%lf",&tseg.p1.x,&tseg.p1.y,&tseg.p2.x,&tseg.p2.y); tseg.index = w; v.erase(remove_if(v.begin(),v.end(),Is_OK),v.end()); v.push_back(tseg); } cout << "Top sticks: "; for(vector<Segment>::iterator it = v.begin(); it!= v.end(); it++) { cout << it->index; if(it != v.end() -1) cout << ", "; else cout << "." << endl; } } return 0; }