【洛谷OJ】P1047 校门外的树

最新推荐文章于 2024-07-06 15:05:23 发布

再启动

最新推荐文章于 2024-07-06 15:05:23 发布

阅读量479

点赞数

分类专栏： OJ

本文链接：https://blog.csdn.net/axwolfer/article/details/81749846

版权

OJ 专栏收录该内容

36 篇文章 0 订阅

订阅专栏

import java.util.Iterator;
import java.util.LinkedList;
import java.util.Scanner;

class Zone{
   int start;
   int end;
   Zone(int start, int end){
       this.start = start;
       this.end = end;
   }
   Zone(){
       start = 0;
       end = 0;
   }

   public int getStart() {
       return start;
   }
   public void setStart(int start) {
       this.start = start;
   }
   public int getEnd() {
       return end;
   }
   public void setEnd(int end) {
       this.end = end;
   }
   @Override
   public String toString() {
       return "Zone [start=" + start + ", end=" + end + "]";
   }

}
public class Main{
   private static Scanner cin;
   private static int PRINT = 0;

   public static void main(String args[])throws Exception {
       cin = new Scanner(System.in);
       LinkedList<Zone> zoneList = new LinkedList<Zone>();
       LinkedList<Zone> zoneListToAdd = new LinkedList<Zone>();
       int l = cin.nextInt();
       int m = 0;
       int ret = 0;
       if (0<=l && 10000>=l) {
           Zone temp = new Zone(0,l);
           zoneList.add(temp);
           m = cin.nextInt();
           if (1<=m && 100>=m) {
               for(int i=0; i<m; i++) {
                   int index = -1;
                   int start = cin.nextInt();
                   int end = cin.nextInt();
                   if (start >= 0 && start<=l && end >=0 && end<=l && start<end) {
                       zoneListToAdd = new LinkedList<Zone>();
                       Zone zoneToJudge = new Zone(start,end);
                       Iterator iterator = zoneList.iterator();
                       while(iterator.hasNext()) {
                           Zone zoneInList = (Zone)iterator.next();
                           if(zoneInList.getEnd() < zoneToJudge.getStart() ) {
                               continue;
                           }else if(zoneInList.getStart() > zoneToJudge.getEnd()){
                               break;
                           }else if(zoneInList.getStart() <= zoneToJudge.getStart()
                                   && zoneInList.getEnd()>=zoneToJudge.getEnd()) {
                               index = (-1 == index) ? zoneList.indexOf(zoneInList) : index;
                               iterator.remove();
                               if(zoneInList.getStart() < zoneToJudge.getStart()) {
                                   zoneListToAdd.add(new Zone(zoneInList.getStart(),zoneToJudge.getStart()-1));
                               }
                               if(zoneToJudge.getEnd()<zoneInList.getEnd()) {
                                   zoneListToAdd.add(new Zone(zoneToJudge.getEnd()+1,zoneInList.getEnd()));
                               }
                               break;
                           }else if(zoneInList.getStart() <= zoneToJudge.getStart()
                                   && zoneInList.getEnd() <= zoneToJudge.getEnd()
                                   && zoneInList.getEnd() >= zoneToJudge.getStart()) {
                               index = (-1 == index) ? zoneList.indexOf(zoneInList) : index;
                               iterator.remove();
                               if(zoneInList.getStart()<zoneToJudge.getStart()) {
                                   zoneListToAdd.add(new Zone(zoneInList.getStart(),zoneToJudge.getStart()-1));
                               }
                               continue;
                           }else if(zoneInList.getStart() >= zoneToJudge.getStart()
                                   && zoneInList.getEnd() >= zoneToJudge.getEnd()
                                   && zoneInList.getStart() > zoneToJudge.getStart()) {
                               index = (-1 == index) ? zoneList.indexOf(zoneInList) : index;
                               iterator.remove();
                               if(zoneToJudge.getEnd() < zoneInList.getEnd()) {
                                   zoneListToAdd.add(new Zone(zoneToJudge.getEnd()+1,zoneInList.getEnd()));
                               }
                               break;
                           }else if (zoneInList.getStart() >= zoneToJudge.getStart()
                                   && zoneInList.getEnd() <= zoneToJudge.getEnd()) {
                               index = (-1 == index) ? zoneList.indexOf(zoneInList) : index;
                               iterator.remove();
                               continue;
                           }
                       }
                       if(zoneListToAdd.size() >0) {
                           if (-1 != index) {
                               iterator = zoneListToAdd.iterator();
                               while(iterator.hasNext()) {
                                   Zone t = (Zone)iterator.next();
                                   zoneList.add(index++,t);
                               }
                           }
                       }
                   }else {
                       continue;
                   }
               }
           }
           Iterator iterator = zoneList.iterator();
           while(iterator.hasNext()) {
               Zone tmpRet = (Zone)iterator.next();
               ret += tmpRet.getEnd() - tmpRet.getStart() + 1;
           }
       }
       System.out.println(ret);
   }


}