2 курс. Программирование на C++. Турнир 3, осень 2021

登录课程 / 比赛任务参与者控制台模块编译器关键字排名表

ru en cn

5945443

User

Кокарева Анастасия Олеговна

Time

19:09<< 31.12.2021 19:10 (27天 19:11) 19:11>>

Processing

19:10 ... 19:10 (2,44 秒)

File

5945443.cpp (CLang++ 5.0.0 + Address Sanitizer)

Contest

2 курс. Программирование на C++. Турнир 3, осень 2021

Problem

D: Graph visitor

Testset

Limits

Time: 1s Memory: 4000Mb

Status [?]

LI	Source check error

source | results

visitor.h:15:  public: should be indented +1 space inside class Vert  [whitespace/indent] [3]
visitor.h:16:  Missing spaces around <  [whitespace/operators] [3]
visitor.h:41:  Line ends in whitespace.  Consider deleting these extra spaces.  [whitespace/end_of_line] [4]
Done processing visitor.h
Total errors found: 3

[打印 | | ]

≡

#include <unordered_map>
#include <iostream>
#include <unordered_set>
#include <vector>
#include <queue>
#include <exception>
#include <map>
#include <memory>
#include <utility>

template <class Vertex>
class BfsVisitor {
 private:
  class Vert {
  public:
    std::map < int, std::pair<int, int» ver;
    int a;
    int b = 0;
  };
  std::shared_ptr<Vert> vrt;

public:
  BfsVisitor() {
  vrt = std::make_shared<Vert>();
  vrt->a = 0;
  vrt->b = 0;
  }

void ExamineVertex(const Vertex &vr) {
    vrt->a = vr;
    vrt->b = vrt->ver[vr].second + 1;
  }

void DiscoverVertex(const Vertex &vr) {
    if (vr == 0) {
      vrt->ver.insert(std::make_pair(0,
      std::make_pair(0, 0)));
    } else if (vrt->ver.find(vr) != vrt->ver.end()) {
        if (vrt->b < vrt->ver[vr].second) {
        vrt->ver[vr].first = vrt->a;
        vrt->ver[vr].second = vrt->b; 
        }
    } else {
      vrt->ver.insert(std::make_pair(vr, std::make_pair(vrt->a,
      vrt->b)));
    }
  }

size_t DistanceTo(const Vertex &trg) const {
    return vrt->ver[trg].second;
  }

Vertex Parent(const Vertex &vr) const {
      return vrt->ver[vr].first;
  }
};

(1 201 b)

0.063s 0.009s 10