QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#779559#8791. Tasks and Bugswoodie_0064#WA 0ms3508kbC++201.1kb2024-11-24 19:57:202024-11-24 19:57:20

Judging History

你现在查看的是最新测评结果

  • [2024-11-24 19:57:20]
  • 评测
  • 测评结果:WA
  • 用时:0ms
  • 内存:3508kb
  • [2024-11-24 19:57:20]
  • 提交

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;
	map<par, bool> vis; 
	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 << "\n"[p++ == 0];
		vector<int> out;
		sort(v.begin(), v.end());
		for(auto y : v){
			vis[{x, y}] = 1, vis[{y, x}] = 1;
			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: 3508kb

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: ''