https://www.acmicpc.net/problem/20006
20006번: 랭킹전 대기열
모든 생성된 방에 대해서 게임의 시작 유무와 방에 들어있는 플레이어들의 레벨과 아이디를 출력한다. 시작 유무와 플레이어의 정보들은 줄 바꿈으로 구분되며 레벨과 아이디는 한 줄에서 공백
www.acmicpc.net
쉽네요
지난번 실버3문제가 더어려웟네여 ㅋㅋ
#include <iostream>
#include <vector>
#include <queue>
#include<string>
#include<algorithm>
#include<cmath>
#include<unordered_map>
#include<map>
#include<stack>
using namespace std;
struct Point {
int i, j, t, cnt, power;
char c;
};
void Prints(vector<vector<int>>maps, int n, int m) {
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cout << maps[i][j] << " ";
}
cout << endl;
}
cout << endl;
}
void Prints(vector<vector<bool>>maps, int n, int m) {
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cout << maps[i][j] << " ";
}
cout << endl;
}
cout << endl;
}
void Prints(vector<vector<char>>maps, int n, int m) {
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cout << maps[i][j];
}
cout << endl;
}
cout << endl;
}
void Prints(vector<vector<vector<char>>>maps, int n, int m, int k) {
for (int t = 0; t < k; t++) {
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cout << maps[t][i][j];
}
cout << endl;
}
cout << endl;
}
cout << endl;
}
void Prints(vector<vector<vector<bool>>>maps, int n, int m, int k) {
for (int t = 0; t < k; t++) {
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cout << maps[t][i][j];
}
cout << endl;
}
cout << endl;
}
cout << endl;
}
void Prints(vector<int>line, int n) {
for (int i = 0; i < n; i++) {
cout << line[i] << ",";
}
cout << endl;
}
void Prints(string str, int n) {
for (int i = 0; i < n; i++) {
cout << str[i] << ",";
}
cout << endl;
}
bool checkmaps(vector<vector<int>>maps, vector<vector<int>>anw, int n, int m) {
bool bCheck = false;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
if (maps[i][j] != anw[i][j]) {
bCheck = true;
i = n + 1;
j = m + 1;
continue;
}
}
}
return bCheck;
}
bool findstart(vector<vector<int>>maps, vector<vector<int>>anw, int n, int m, int) {
bool bCheck = false;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
if (maps[i][j] != anw[i][j]) {
bCheck = true;
i = n + 1;
j = m + 1;
continue;
}
}
}
return bCheck;
}
struct Data {
int level;
string nickname;
};
struct Room {
int cnt;
int roomLevel;
string status;
vector<Data>players;
};
bool cmp(const Data &a,const Data &b) {
return a.nickname < b.nickname;
}
int main() {
int p,m;
cin >> p >> m;
vector<Data>players;
for (int i = 0; i < p; i++) {
Data tmp;
int l;
string nick;
cin >> l;
cin >> nick;
tmp.level=l;
tmp.nickname = nick;
players.push_back(tmp);
}
vector<Room>rooms;
for (int i = 0; i < players.size(); i++) {
if (rooms.size() == 0) {
Room r;
r.cnt = 1;
r.status = "Waiting!";
if (r.cnt == m) {
r.status = "Started!";
}
r.roomLevel = players[i].level;
r.players.push_back(players[i]);
rooms.push_back(r);
}
else {
bool bCheck = false;
int tmpRoomSize = rooms.size();
for (int j = 0; j < tmpRoomSize; j++) {
//방확인
int roomlevel = rooms[j].roomLevel;
int roomcnt = rooms[j].cnt;
int roomlevelRangeplus = roomlevel + 10;
int roomlevelRangeminu = roomlevel - 10;
if (players[i].level <= roomlevelRangeplus && players[i].level >= roomlevelRangeminu && roomcnt < m) {
//내 점수에 맞는방이 존재
rooms[j].cnt = rooms[j].cnt + 1;//4+1
rooms[j].players.push_back(players[i]);
sort(rooms[j].players.begin(), rooms[j].players.end(),cmp);
if (rooms[j].cnt == m) {
rooms[j].status = "Started!";
}
j = tmpRoomSize + 1;
bCheck = true;
continue;
}
}
if(bCheck==false){
//내 점수에 맞는 방이 존재하지 않는경우
//방이 없는경우
Room r;
r.cnt = 1;
r.status = "Waiting!";
if (r.cnt == m) {
r.status = "Started!";
}
r.roomLevel = players[i].level;
r.players.push_back(players[i]);
rooms.push_back(r);
//j = tmpRoomSize + 1;
continue;
}
}
}
for (int i = 0; i < rooms.size(); i++) {
cout << rooms[i].status << '\n';
for (int j = 0; j < rooms[i].players.size(); j++) {
cout << rooms[i].players[j].level << " " << rooms[i].players[j].nickname << '\n';
}
}
return 0;
}