problemscpp
A collection of my answers to algorithm problems in c++.
载入中...
搜索中...
未找到
comp526.h
浏览该文件的文档.
1//
2// Created by wangzhiheng on 26/09/2025.
3//
4
5#ifndef PROBLEMSCPP_COMO526_H
6#define PROBLEMSCPP_COMO526_H
7
8#include <iosfwd>
9#include <set>
10#include <unordered_map>
11#include <unordered_set>
12#include <vector>
13
14using namespace std;
15
16namespace comp526 {
17 namespace stable_matching {
18 class Student;
19 class Company;
20 class Student {
21 public:
22 Student(int id): id(id) {};
23 int id = -1;
25 unordered_map<int, Company *> priority_c;
26 unordered_map<Company *, int> c_priority;
28 };
29
30 class Company {
31 public:
32 Company(int id): id(id) {};
33 int id = -1;
34 unordered_map<Student *, int> priority;
36 unordered_set<Student *> proposed_students;
37 };
38
39 class Solution {
40 private:
41 vector<Student *> students;
42 vector<Company *> companies;
43
44 public:
45 vector<int> match(vector<vector<int>>, vector<vector<int>>);
46 };
47 }// namespace stable_matching
48
49 namespace oddecho {
50 int main(istream & /*cin*/, ostream & /*cout*/);
51 }
52
53 namespace recount {
54 int main(istream & /*cin*/, ostream & /*cout*/);
55 }
56
57 namespace set {
58 class card {
59 public:
60 int id;
61 char f[4];
62 card(int id, string s);
63 };
64 class cardset {
65 public:
66 unsigned short mask = -1;
67 int cnt = 0;
68 unordered_set<card *> cards{};
69 cardset() = default;
70 cardset(card *c);
71 void insert(card *c);
72 };
73
74 int main(istream & /*cin*/, ostream & /*cout*/);
75 }// namespace set
76
77 namespace plantingtrees {
78 int main(istream & /*cin*/, ostream & /*cout*/);
79 }
80
81 namespace snowflakes {
82 int main(istream & /*cin*/, ostream & /*cout*/);
83 }
84
85 namespace amalgram {
86 int main(istream & /*cin*/, ostream & /*cout*/);
87 }
88}// namespace comp526
89
90#endif//PROBLEMSCPP_COMO526_H
int main(istream &cin, ostream &cout)
int main(istream &cin, ostream &cout)
int main(istream &cin, ostream &cout)
int main(istream &cin, ostream &cout)
int main(istream &cin, ostream &cout)
int main(istream &cin, ostream &cout)
unordered_map< int, Company * > priority_c
unordered_map< Company *, int > c_priority
unordered_set< Student * > proposed_students
unordered_map< Student *, int > priority
vector< int > match(vector< vector< int > >, vector< vector< int > >)
card(int id, string s)
unordered_set< card * > cards
unsigned short mask