種子論壇 | 高雄市資訊培育協會學員討論區

#include <bits/stdc++.h>
using namespace std;
struct File{
int fileInfo[5] = {0};
};
class Cmp{
public:
bool operator() (const File &lhs, const File &rhs)
{
for(auto i: Cmp::sort_order)
{
if(i<0)
{
i *= -1;
if(lhs.fileInfo[i]!=rhs.fileInfo[i])
return lhs.fileInfo[i]>rhs.fileInfo[i];
}
else
{
if(lhs.fileInfo[i]!=rhs.fileInfo[i])
return lhs.fileInfo[i]<rhs.fileInfo[i];
}
}
return false;
}
static vector<int> sort_order;
};
vector<int> Cmp::sort_order;
int main()
{
Cmp::sort_order.clear();
int N, K;
cin >> N >> K;
vector<File> lists(N);
for(int i=0; i<N; ++i)
{
File &f = lists[i];
for(int info=0; info<4; ++info)
cin >> f.fileInfo[info+1];
f.fileInfo[0] = i;
}
vector<int> orders(K);
for(auto &i:orders)
cin >> i;
reverse(orders.begin(), orders.end());
//process click orders
vector<bool> appeared(5, false);
int prev = orders[0], cnt = 1;
for(int i=1; i<orders.size(); ++i)
{
if(orders[i]==prev)cnt += 1;
else
{
if(appeared[prev]==false)
{
appeared[prev] = true;
if(cnt%2==0)prev *= -1;
Cmp::sort_order.push_back(prev);
}
cnt = 1;
}
prev = orders[i];
}
if(appeared[prev]==false)
{
if(cnt%2==0)prev *= -1;
Cmp::sort_order.push_back(prev);
}
Cmp::sort_order.push_back(0);
sort(lists.begin(), lists.end(), Cmp());
for(auto &f: lists)
{
for(int i=1; i<=4; ++i)
{
cout << f.fileInfo[i] << ' ';
}
cout << '\n';
}
return 0;
}
/*
3 7
1 2 5 8
2 4 6 8
3 3 6 7
2 2 2 3 3 3 3
*/

複製代碼

//#include <iostream>
//#include <vector>
//#include <algorithm>
#include <bits/stdc++.h>
using namespace std;
// 定義檔案結構體
struct File {
int name;//檔案名稱
int modified_time;//修改時間
int type;//檔案類型
int size;//檔案大小
int original_index; // 紀錄初始索引，確保穩定排序
};
// 比較函數類別，用來根據指定屬性進行排序
class FileComparator {
private:
int attribute;//屬性
bool ascending;//排序順序
public:
FileComparator(int attr, bool asc) : attribute(attr), ascending(asc) {}//定義排序邏輯，根據傳入的屬性 (attribute) 和排序順序 (ascending) 進行比較
bool operator()(const File a, const File b) {
int valA, valB;
// 根據屬性選擇比較值
switch (attribute) {
case 1: valA = a.name; valB = b.name; break;
case 2: valA = a.modified_time; valB = b.modified_time; break;
case 3: valA = a.type; valB = b.type; break;
case 4: valA = a.size; valB = b.size; break;
default: return false;
}
// 進行升序或降序比較
if (valA != valB)
return ascending ? (valA < valB) : (valA > valB);
// 如果屬性值相同，按原始順序排序
return a.original_index < b.original_index;
}
};
int main() {
int N, K;
cin >> N >> K;
vector<File> files(N);
// 讀入檔案資料
for (int i = 0; i < N; i++) {
cin >> files[i].name >> files[i].modified_time >> files[i].type >> files[i].size;
files[i].original_index = i;
}
vector<int> operations(K);
// 讀入操作資料
for (int i = 0; i < K; i++) {
cin >> operations[i];
}
// 記錄每個屬性目前的升降序狀態，預設為升序
vector<bool> ascending(5, true);
// 按操作順序進行排序
for (int op : operations) {
// 依指定屬性排序
sort(files.begin(), files.end(), FileComparator(op, ascending[op]));
// 切換該屬性的升降序狀態
ascending[op] = !ascending[op];
}
// 輸出結果
for (const auto file : files) {
cout << file.name << " " << file.modified_time << " " << file.type << " " << file.size << endl;
}
return 0;
}
/*
3 7
1 2 5 8
2 4 6 8
3 3 6 7
2 2 2 3 3 3 3
*/

複製代碼