QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#779567 | #8791. Tasks and Bugs | woodie_0064# | WA | 0ms | 3612kb | C++20 | 1.0kb | 2024-11-24 20:00:52 | 2024-11-24 20:00:53 |
Judging History
answer
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <sstream>
#include <string>
#include <utility>
using namespace std;
using par = pair<int, int>;
const int N = 1e5 + 3;
int T;
int n, num;
void work(){
string s;
map<int,vector<int>> adj;
int cnt = 0;
while(getline(cin, s)){
istringstream input_stream(s);
string s1; char c; int fa, son;
input_stream >> c >> c >> c >> fa >> c;
while(input_stream >> c >> c >> c >> son){
adj[son].push_back(fa);
input_stream >> c;
}
}
int p = 0;
for(auto &[x, v] : adj){
cout << " "[p == 0] << "\n"[p++ == 0];
vector<int> out;
sort(v.begin(), v.end());
for(auto y : v)
out.push_back(y);
if(!out.empty()){
cout << "CS-" << x << ": ";
int sz = out.size();
for(int i = 0; i < sz; ++i)
cout << "CS-" << out[i] << ","[i == sz-1] << " "[i == sz-1];
}
}
}
int main(){
// freopen("test.txt", "r", stdin);
ios::sync_with_stdio(false);
cin.tie(0);
int T = 1;
while(T--){
work();
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 0ms
memory: 3612kb
input:
CS-20: CS-1 CS-100: CS-239 CS-300: CS-239, CS-11111
output:
result:
wrong answer 1st lines differ - expected: 'CS-1: CS-20', found: ''