Strategi Latihan Soal

#include <iostream>
#include <vector>
#include <string>
#include <unordered_map>
#include <algorithm>
#include <iomanip>
using namespace std;

struct Problem {
    string id;            // mis. "LeetCode 200"
    string topic;
    int difficulty;       // 1=easy, 2=medium, 3=hard
    string last_status;   // "AC", "WA", "TLE", "unattempted"
    int attempts;         // berapa kali dicoba
    int days_since_last;  // hari sejak terakhir dilihat
    int mastery;          // 0-5, 5=mahir
};

class PracticeTracker {
public:
    void addProblem(const Problem& p) {
        problems_[p.id] = p;
    }

    void recordAttempt(const string& id, const string& status) {
        auto& p = problems_[id];
        p.last_status = status;
        p.attempts++;
        p.days_since_last = 0;
        if (status == "AC") {
            p.mastery = min(5, p.mastery + 1);
        } else {
            p.mastery = max(0, p.mastery - 1);
        }
    }

    void advanceDay() {
        for (auto& kv : problems_) kv.second.days_since_last++;
    }

    // Spaced repetition: soal dengan mastery rendah & lama tidak dilihat diprioritaskan
    vector<string> recommendReview(int top_k = 5) {
        vector<pair<int,string>> scored;
        for (const auto& kv : problems_) {
            const Problem& p = kv.second;
            if (p.last_status == "unattempted") continue;
            int score = (5 - p.mastery) * 3 + p.days_since_last;
            // Mastery 5 tetap perlu review berkala (decay)
            if (p.mastery == 5 && p.days_since_last < 14) continue;
            scored.push_back({-score, p.id});  // negatif untuk sort asc = score tertinggi
        }
        sort(scored.begin(), scored.end());
        vector<string> result;
        for (int i = 0; i < min(top_k, (int)scored.size()); ++i) {
            result.push_back(scored[i].second);
        }
        return result;
    }

    // Deliberate practice: pilih soal pada area kelemahan
    vector<string> recommendWeakness(int top_k = 3) {
        unordered_map<string, pair<int,int>> topic_stat;
        for (const auto& kv : problems_) {
            const Problem& p = kv.second;
            if (p.last_status == "unattempted") continue;
            topic_stat[p.topic].first += p.mastery;
            topic_stat[p.topic].second++;
        }
        vector<pair<double,string>> weak_topics;
        for (const auto& kv : topic_stat) {
            double avg = (double)kv.second.first / kv.second.second;
            weak_topics.push_back({avg, kv.first});
        }
        sort(weak_topics.begin(), weak_topics.end());

        vector<string> result;
        for (const auto& wt : weak_topics) {
            for (const auto& kv : problems_) {
                const Problem& p = kv.second;
                if (p.topic == wt.second && p.last_status == "unattempted") {
                    result.push_back(p.id);
                    if ((int)result.size() >= top_k) return result;
                }
            }
        }
        return result;
    }

    void report() {
        cout << "=== Status Latihan ===\n";
        cout << left << setw(15) << "Problem" << setw(12) << "Topic"
             << setw(8) << "Diff" << setw(12) << "Status"
             << setw(10) << "Attempts" << setw(9) << "Mastery"
             << setw(6) << "Days" << "\n";
        cout << "---------------|------------|--------|------------|---------|--------|----\n";
        for (const auto& kv : problems_) {
            const Problem& p = kv.second;
            cout << left << setw(15) << p.id
                 << setw(12) << p.topic
                 << setw(8) << diffLabel(p.difficulty)
                 << setw(12) << p.last_status
                 << setw(10) << p.attempts
                 << setw(9) << p.mastery
                 << setw(6) << p.days_since_last << "\n";
        }
    }

private:
    unordered_map<string, Problem> problems_;

    static string diffLabel(int d) {
        switch (d) {
            case 1: return "Easy";
            case 2: return "Medium";
            case 3: return "Hard";
            default: return "?";
        }
    }
};

int main() {
    PracticeTracker tracker;

    tracker.addProblem({"LC-200", "graph",    2, "AC",  2, 3, 2});
    tracker.addProblem({"LC-207", "graph",    2, "WA",  3, 1, 1});
    tracker.addProblem({"LC-322", "dp",       3, "WA",  4, 0, 0});
    tracker.addProblem({"LC-70",  "dp",       1, "AC",  1, 4, 5});
    tracker.addProblem({"LC-1",   "hashing",  1, "AC",  2, 5, 30});
    tracker.addProblem({"LC-300", "dp",       2, "unattempted", 0, 0, 0});
    tracker.addProblem({"LC-739", "stack",    2, "unattempted", 0, 0, 0});
    tracker.addProblem({"LC-215", "heap",     2, "AC",  2, 3, 7});
    tracker.addProblem({"LC-23",  "heap",     3, "unattempted", 0, 0, 0});

    tracker.report();

    cout << "\n=== Spaced Repetition: Top 5 Soal untuk Review ===\n";
    auto review = tracker.recommendReview(5);
    for (const auto& id : review) cout << "  - " << id << "\n";

    cout << "\n=== Deliberate Practice: 3 Soal di Area Kelemahan ===\n";
    auto weak = tracker.recommendWeakness(3);
    for (const auto& id : weak) cout << "  - " << id << "\n";

    cout << "\n=== Pola Latihan Mingguan ===\n";
    cout << "Senin:    2 soal baru di area kelemahan\n";
    cout << "Selasa:   2 soal review (spaced repetition)\n";
    cout << "Rabu:     1 hard problem (fokus mendalam)\n";
    cout << "Kamis:    2 soal baru di area kuat (pertahankan)\n";
    cout << "Jumat:    Upsolve 1 soal yang sebelumnya WA/TLE\n";
    cout << "Sabtu:    Mock contest (4 soal acak, 90 menit)\n";
    cout << "Minggu:   Refleksi mingguan + baca editorial\n";
    return 0;
}

=== Status Latihan ===
Problem        Topic       Diff    Status      Attempts  Mastery Days
---------------|------------|--------|------------|---------|--------|----
LC-23          heap        Hard    unattempted0         0       0
LC-215         heap        Medium  AC          2         3       7
LC-739         stack      Medium  unattempted0         0       0
LC-1           hashing    Easy    AC          2         5       30
LC-70          dp         Easy    AC          1         4       5
LC-322         dp         Hard    WA          4         0       0
LC-207         graph      Medium  WA          3         1       1
LC-300         dp         Medium  unattempted0         0       0
LC-200         graph      Medium  AC          2         2       3

=== Spaced Repetition: Top 5 Soal untuk Review ===
  - LC-322
  - LC-207
  - LC-200
  - LC-215
  - LC-1

=== Deliberate Practice: 3 Soal di Area Kelemahan ===
  - LC-300
  - LC-23

=== Pola Latihan Mingguan ===
Senin:    2 soal baru di area kelemahan
Selasa:   2 soal review (spaced repetition)
Rabu:     1 hard problem (fokus mendalam)
Kamis:    2 soal baru di area kuat (pertahankan)
Jumat:    Upsolve 1 soal yang sebelumnya WA/TLE
Sabtu:    Mock contest (4 soal acak, 90 menit)
Minggu:   Refleksi mingguan + baca editorial